✦ LIBER ✦

Analysis of an adaptive algorithm to find the two nearest neighbors

✍ Scribed by P. V. Poblete

Book ID: 110621254
Publisher: Springer
Year: 2001
Tongue: English
Weight: 411 KB
Volume: 29
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf02679620

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Probabilistic analysis of an algorithm f

Probabilistic analysis of an algorithm for solving thek-dimensional all-nearest-neighbors problem by projection

✍ Frank Bartling; Klaus Hinrichs 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 528 KB

An analysis of how training data complex

An analysis of how training data complexity affects the nearest neighbor classifiers

✍ J. S. Sánchez; R. A. Mollineda; J. M. Sotoca 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 745 KB

An iterative algorithm for finding a nea

An iterative algorithm for finding a nearest pair of points in two convex subsets of Rn

✍ B. Llanas; M. Fernandez de Sevilla; V. Feliu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 536 KB

We present an algorithm for finding a nearest pair of points in two convex sets of R n, and therefore, their distance. The algorithm is based on the fixed-point theory of nonexpansive operators on a Hilbert space. Its practical implementation requires a fast projection algorithm. We introduce such a

An algorithm to find an element of the c

An algorithm to find an element of the conjugate cone

✍ I. V. Konnov; R. F. Khabibullin 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 300 KB

Construction of an effective algorithm t

Construction of an effective algorithm to find the isomorphism of two simple finite semigroups

✍ V. A. Makarenko 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 708 KB

An Optimal Algorithm to Find the Jump Nu

An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets

✍ L. Bianco; P. Dell‘Olmo; S. Giordani 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 149 KB