๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient k nearest neighbors searching algorithm for a query line

โœ Scribed by Subhas C. Nandy; Sandip Das; Partha P. Goswami

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
289 KB
Volume
299
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient design of a nearest neighbo
An efficient design of a nearest neighbor classifier for various-scale problems
โœ Heesung Lee; Sungjun Hong; Imran Fareed Nizami; Euntai Kim ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 615 KB

By appropriate editing of the reference set and judicious selection of features, we can obtain an optimal nearest neighbor (NN) classifier that maximizes the accuracy of classification and saves computational time and memory resources. In this paper, we propose a new method for simultaneous referenc

An Efficient NC Algorithm for a Sparse k
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate
โœ Hiroshi Nagamochi; Toru Hasunuma ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 166 KB

We present an efficient algorithm for finding a sparse k-edge-connectivity certificate of a multigraph G. Our algorithm runs in O log kn log k 2 log n 2 time using O k n + m processors on an ARBITRARY CRCW PRAM, where n and m stand for the numbers of vertices in G and edges in the simplified graph o