Sciweavers

5962 search results - page 1128 / 1193
» Efficient Clustering for Orders
Sort
View
STOC
2003
ACM
90views Algorithms» more  STOC 2003»
16 years 1 months ago
Work-competitive scheduling for cooperative computing with dynamic groups
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
Chryssis Georgiou, Alexander Russell, Alexander A....
191
Voted
VLDB
2005
ACM
109views Database» more  VLDB 2005»
16 years 1 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 1 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
182
Voted
VLDB
2008
ACM
103views Database» more  VLDB 2008»
16 years 1 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...
SIGMOD
2009
ACM
214views Database» more  SIGMOD 2009»
16 years 1 months ago
DDE: from dewey to a fully dynamic XML labeling scheme
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...
Liang Xu, Tok Wang Ling, Huayu Wu, Zhifeng Bao
« Prev « First page 1128 / 1193 Last » Next »