Sciweavers

675 search results - page 22 / 135
» Biased Range Trees
Sort
View
112
Voted
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 5 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
MDM
2007
Springer
195views Communications» more  MDM 2007»
15 years 5 months ago
BORA: Routing and Aggregation for Distributed Processing of Spatio-Temporal Range Queries
This work tackles the problem of answer-aggregation for continuous spatio-temporal range queries in distributed settings. We assume a grid-like coverage of the spatial universe of...
Goce Trajcevski, Hui Ding, Peter Scheuermann, Isab...
99
Voted
IJSNET
2006
217views more  IJSNET 2006»
14 years 11 months ago
Optimal sleep scheduling with transmission range assignment in application-specific wireless sensor networks
: To extend the functional lifetime of battery-operated Wireless Sensor Networks (WSNs), stringent sleep scheduling strategies with communication duty cycles running at sub-1% rang...
Rick W. Ha, Pin-Han Ho, Xuemin Shen
79
Voted
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
15 years 4 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
DOLAP
1998
ACM
15 years 3 months ago
Dynamic Maintenance of Multidimensional Range Data Partitioning for Parallel Data Processing
Star schema has been a typical model for both online transaction processing in traditional databases and online analytical processing in large data warehouses. In the star schema,...
Junping Sun, William I. Grosky