Sciweavers

68 search results - page 6 / 14
» Obtaining Quick Results for Approximate Answers
Sort
View
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
13 years 9 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
W2GIS
2009
Springer
14 years 2 months ago
Database and Representation Issues in Geographic Information Systems (GIS)
Abstract. A review is provided of some database and representation issues involved in the implementation of geographic information systems (GIS). The increasing popularity of web-b...
Hanan Samet
MICAI
2005
Springer
14 years 1 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...
IPSN
2004
Springer
14 years 28 days ago
A probabilistic approach to inference with limited information in sensor networks
We present a methodology for a sensor network to answer queries with limited and stochastic information using probabilistic techniques. This capability is useful in that it allows...
Rahul Biswas, Sebastian Thrun, Leonidas J. Guibas
VLDB
2001
ACM
115views Database» more  VLDB 2001»
13 years 12 months ago
Dynamic Update Cube for Range-sum Queries
A range-sum query is very popular and becomes important in finding trends and in discovering relationships between attributes in diverse database applications. It sums over the se...
Seok-Ju Chun, Chin-Wan Chung, Ju-Hong Lee, Seok-Ly...