✦ LIBER ✦

A Branch and Bound Algorithm for Computing k-Nearest Neighbors

✍ Scribed by Fukunaga, K.; Narendra, P.M.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved branch and bound algorithm f

✍ Behrooz Kamgar-Parsi; Laveen N Kanal 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 350 KB

Analysis of k-nearest neighbor branch an

✍ Soren Larsen; Laveen N Kanal 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 364 KB

An efficient k nearest neighbors searchi

✍ Subhas C. Nandy; Sandip Das; Partha P. Goswami 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Editing for the k-nearest neighbors rule

✍ Ludmila I. Kuncheva 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 447 KB

Efficient algorithms for computing two n

✍ Tzong-Wann Kao; Shi-Jinn Horng 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 782 KB

Parallel branch and bound algorithm for

✍ Chen, X.; Zhou, K. 📂 Article 📅 2003 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 223 KB