Sciweavers

158 search results - page 21 / 32
» Approximate Range Mode and Range Median Queries
Sort
View
CCCG
2010
13 years 8 months ago
Connected dominating sets on dynamic geometric graphs
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
Leonidas J. Guibas, Nikola Milosavljevic, Arik Mot...
CIKM
2006
Springer
13 years 10 months ago
KDDCS: a load-balanced in-network data-centric storage scheme for sensor networks
We propose an In-Network Data-Centric Storage (INDCS) scheme for answering ad-hoc queries in sensor networks. Previously proposed In-Network Storage (INS) schemes suffered from St...
Mohamed Aly, Kirk Pruhs, Panos K. Chrysanthis
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 6 days 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
TKDE
2008
162views more  TKDE 2008»
13 years 6 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...
PODS
2000
ACM
179views Database» more  PODS 2000»
13 years 11 months ago
Selectivity Estimation for Boolean Queries
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukris...