80 search results - page 13 / 16 » Nearest Neighbor Search Using Additive Binary Tree |
84
Voted
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
129
Voted
COMPGEOM
2010
ACM
15 years 2 months 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 ...
126
Voted
PVLDB
2011
14 years 10 days ago
2011
The Hausdorff distance is commonly used as a similarity measure between two point sets. Using this measure, a set X is considered similar to Y iff every point in X is close to at ...
75
Voted
CCS
2009
ACM
15 years 4 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...
ICCBR
2007
Springer
15 years 3 months ago
2007
Springer
The problem of label ranking has recently been introduced as an extension of conventional classification in the field of machine learning. In this paper, we argue that label ran...