Sciweavers

2498 search results - page 19 / 500
» Data Structures with Unpredictable Timing
Sort
View
ICALP
2003
Springer
15 years 2 months ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen
JSW
2008
122views more  JSW 2008»
14 years 9 months ago
Modeling and Analysis the Web Structure Using Stochastic Timed Petri Nets
Precise analysis of the Web structure can facilitate data pre-processing and enhance the accuracy of the mining results in the procedure of Web usage mining. STPN Stochastic Timed...
Pozung Chen, Chu-Hao Sun, Shih-Yang Yang
COCOON
2005
Springer
15 years 3 months ago
Opportunistic Data Structures for Range Queries
Abstract In this paper, we study the problem of supporting range sum queries on a compressed sequence of values. For a sequence of n k-bit integers, k ≤ O(log n), our data struct...
Chung Keung Poon, Wai Keung Yiu
83
Voted
SEUS
2007
IEEE
15 years 3 months ago
A Wireless System for Real-Time Environmental and Structural Monitoring
Abstract. Accurate real-time monitoring of structural health can result in significant safety improvements, while providing data that can be used to improve design and constructio...
Valerio Plessi, Filippo Bastianini, Sahra Sedigh
WADS
2001
Springer
106views Algorithms» more  WADS 2001»
15 years 2 months ago
Succinct Dynamic Data Structures
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao