Sciweavers

621 search results - page 36 / 125
» Efficient algorithms for minimizing tree pattern queries
Sort
View
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
13 years 11 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
GIS
2009
ACM
14 years 9 months ago
On-Line Discovery of Flock Patterns in Spatio-Temporal Data
With the recent advancements and wide usage of location detection devices, large quantities of data are collected by GPS and cellular technologies in the form of trajectories. Whi...
Marcos R. Vieira, Petko Bakalov, Vassilis J. Tsotr...
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
14 years 8 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
DAWAK
2009
Springer
13 years 12 months ago
Skyline View: Efficient Distributed Subspace Skyline Computation
Skyline queries have gained much attention as alternative query semantics with pros (e.g.low query formulation overhead) and cons (e.g.large control over result size). To overcome ...
Jinhan Kim, Jongwuk Lee, Seung-won Hwang
AHSWN
2008
92views more  AHSWN 2008»
13 years 8 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal