108 search results - page 20 / 22 » Cover Trees for Nearest Neighbor |
COMPGEOM
2010
ACM
14 years 3 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
We consider the problem of the binary classification on imbalanced data, in which nearly all the instances are labelled as one class, while far fewer instances are labelled as the...
CCS
2009
ACM
14 years 1 months ago
2009
ACM
A major challenge of the anti-virus (AV) industry is how to effectively process the huge influx of malware samples they receive every day. One possible solution to this problem i...
MM
2003
ACM
14 years 8 days ago
2003
ACM
This paper describes a novel methodology for implementing video search functions such as retrieval of near-duplicate videos and recognition of actions in surveillance video. Video...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...