Sciweavers

100 search results - page 8 / 20
» A distributed incremental nearest neighbor algorithm
Sort
View
ICPR
2000
IEEE
15 years 10 months ago
Data Condensation in Large Databases by Incremental Learning with Support Vector Machines
An algorithmfor data condensation using support vector machines (SVM's)is presented. The algorithm extracts datapoints lying close to the class boundaries,whichform a much re...
Pabitra Mitra, C. A. Murthy, Sankar K. Pal
ICDE
2006
IEEE
164views Database» more  ICDE 2006»
15 years 11 months ago
Nearest Surrounder Queries
In this paper, we study a new type of spatial query, Nearest Surrounder (NS), which searches the nearest surrounding spatial objects around a query point. NS query can be more use...
Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong
FOCS
2008
IEEE
15 years 4 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
COMPGEOM
2006
ACM
15 years 3 months ago
Lower bounds on locality sensitive hashing
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
Rajeev Motwani, Assaf Naor, Rina Panigrahy
SSD
1995
Springer
97views Database» more  SSD 1995»
15 years 1 months ago
Ranking in Spatial Databases
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Gísli R. Hjaltason, Hanan Samet