Sciweavers

1396 search results - page 19 / 280
» Succinct Dynamic Data Structures
Sort
View
VISUALIZATION
2005
IEEE
14 years 2 months ago
Illustration and Photography Inspired Visualization of Flows and Volumes
Understanding and analyzing complex volumetrically varying data is a difficult problem. Many computational visualization techniques have had only limited success in succinctly po...
Nikolai A. Svakhine, Yun Jang, David S. Ebert, Kel...
ICALP
2004
Springer
14 years 1 months ago
A General Technique for Managing Strings in Comparison-Driven Data Structures
Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons,...
Gianni Franceschini, Roberto Grossi
SIGMOD
2003
ACM
239views Database» more  SIGMOD 2003»
14 years 8 months ago
D(k)-Index: An Adaptive Structural Summary for Graph-Structured Data
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
Chen Qun, Andrew Lim, Kian Win Ong
ICCS
2005
Springer
14 years 2 months ago
PATM: Priority-Based Adaptive Topology Management for Efficient Routing in Ad Hoc Networks
Abstract. We propose a distributed and adaptive topology management algorithm, called PATM (Priority-based Adaptive Topology Management), that constructs and maintains a connected ...
Haixia Tan, Weilin Zeng, Lichun Bao
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
13 years 9 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...