𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Randomized Algorithms for the Repeated Median Line Estimator

✍ Scribed by J. Matoušek; D. M. Mount; N. S. Netanyahu

Publisher
Springer
Year
1998
Tongue
English
Weight
229 KB
Volume
20
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for estimating the
Efficient algorithms for estimating the general linear model
✍ Petko Yanev; Erricos John Kontoghiorghes 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 244 KB

Computationally efficient serial and parallel algorithms for estimating the general linear model are proposed. The sequential block-recursive algorithm is an adaptation of a known Givens strategy that has as a main component the Generalized QR decomposition. The proposed algorithm is based on orthog

Algorithms for the likelihood-based esti
Algorithms for the likelihood-based estimation of the random coefficient model
✍ Chungyeol Shin; Yasuo Amemiya 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 721 KB

The existing algorithms for fitting the random coefficient models tend to have difficulties associated with the covariance matrix parameter space. New ML and REML algorithms are developed, explicitly addressing the parameter space problem. Theoretical justification and numerical results are presente

Efficient special case algorithms for th
Efficient special case algorithms for the n-line planar traveling salesman problem
✍ M. Cutler 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

## Abstract The traveling salesman problem, path, or cycle is NP‐complete. All known exact solutions to this problem are exponential. In the __N‐line planar__ traveling salesman problem the points are on __N__ lines in the plane. In this paper, simple and efficient low‐degree polynomial solutions a