9 search results - page 1 / 2 » Partial match queries in random quadtrees |
CORR
2012
Springer
12 years 10 days ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
CVPR
2007
IEEE
14 years 6 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...