649 search results - page 11 / 130 » Some Methods of Replacing the Nearest Neighbor Method |
NIPS
2007
13 years 10 months ago
2007
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
JACM
2010
13 years 7 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
SSDBM
2010
IEEE
14 years 2 months ago
2010
IEEE
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...
ICRA
2009
IEEE
14 years 3 months ago
2009
IEEE
— In mobile robotics, the segmentation of range data is an important prerequisite to object recognition and environment understanding. This paper presents an algorithm for realti...
ICDAR
2003
IEEE
14 years 2 months ago
2003
IEEE
The nearest-neighbor based document skew detection methods do not require the presence of a predominant text area, and are not subject to skew angle limitation. However, the accur...