Sciweavers

356 search results - page 30 / 72
» Continuous Nearest Neighbor Search
Sort
View
FOCS
2008
IEEE
15 years 6 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
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...
Rina Panigrahy, Kunal Talwar, Udi Wieder
DEXA
2006
Springer
190views Database» more  DEXA 2006»
15 years 4 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic
110
Voted
DEXA
2010
Springer
213views Database» more  DEXA 2010»
15 years 1 months ago
Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks
The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
121
Voted
DEXAW
1999
IEEE
152views Database» more  DEXAW 1999»
15 years 4 months ago
Advanced Metrics for Class-Driven Similarity Search
This paper presents two metrics for the Nearest Neighbor Classifier that share the property of being adapted, i.e. learned, on a set of data. Both metrics can be used for similari...
Paolo Avesani, Enrico Blanzieri, Francesco Ricci
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
16 years 1 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...