✦ LIBER ✦

An improved branch and bound algorithm for computing k-nearest neighbors

✍ Scribed by Behrooz Kamgar-Parsi; Laveen N Kanal

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Branch and Bound Algorithm for Computi

✍ Fukunaga, K.; Narendra, P.M. 📂 Article 📅 1975 🏛 IEEE 🌐 English ⚖ 887 KB

An improved K-nearest-neighbor algorithm

✍ Shengyi Jiang; Guansong Pang; Meiling Wu; Limin Kuang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 452 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

An improved branch and bound algorithm f

✍ Ebendt, R.; Gunther, W.; Drechsler, R. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 462 KB

An improved branch and bound algorithm f

✍ Brian Borchers; John E. Mitchell 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 870 KB