Sciweavers

402 search results - page 67 / 81
» Nearest Surrounder Queries
Sort
View
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 1 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
JMLR
2006
206views more  JMLR 2006»
13 years 7 months ago
New Algorithms for Efficient High-Dimensional Nonparametric Classification
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if w...
Ting Liu, Andrew W. Moore, Alexander G. Gray
TKDE
2008
162views more  TKDE 2008»
13 years 7 months ago
Continuous k-Means Monitoring over Moving Objects
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...
GIS
2004
ACM
14 years 8 months ago
Supporting spatial aggregation in sensor network databases
Sensor networks are unattended deeply distributed systems whose schema can be conceptualized using the relational model. Aggregation queries on the data sampled at each ode are th...
Mehdi Sharifzadeh, Cyrus Shahabi
MM
2009
ACM
137views Multimedia» more  MM 2009»
14 years 2 months ago
Lightweight web image reranking
Web image search is inspired by text search techniques; it mainly relies on indexing textual data that surround the image file. But retrieval results are often noisy and image pro...
Adrian Popescu, Pierre-Alain Moëllic, Ioannis...