Sciweavers

1038 search results - page 16 / 208
» Space-Bounded Query Approximation
Sort
View
TPDS
2008
120views more  TPDS 2008»
14 years 11 months ago
A New Storage Scheme for Approximate Location Queries in Object-Tracking Sensor Networks
Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain d...
Jianliang Xu, Xueyan Tang, Wang-Chien Lee
TCOS
2010
14 years 10 months ago
Approximate Shortest Path Queries Using Voronoi Duals
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
Shinichi Honiden, Michael E. Houle, Christian Somm...
202
Voted
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 26 days ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
EDBT
2009
ACM
131views Database» more  EDBT 2009»
15 years 2 months ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner
INFOSCALE
2009
ACM
15 years 4 months ago
CAWA: Continuous Approximate Where-About Queries
With the current proliferation of wireless networks and mobile device technologies, the management of moving object databases to facilitate queries over these domains has been exte...
Alexander J. Aved, Kien A. Hua, Antoniya Petkova