Sciweavers

110 search results - page 4 / 22
» A persistent union-find data structure
Sort
View
WEA
2007
Springer
131views Algorithms» more  WEA 2007»
14 years 1 months ago
On the Cost of Persistence and Authentication in Skip Lists
We present an extensive experimental study of authenticated data structures for dictionaries and maps implemented with skip lists. We consider realizations of these data structures...
Michael T. Goodrich, Charalampos Papamanthou, Robe...
FAST
2011
12 years 10 months ago
Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory
The predicted shift to non-volatile, byte-addressable memory (e.g., Phase Change Memory and Memristor), the growth of “big data”, and the subsequent emergence of frameworks su...
Shivaram Venkataraman, Niraj Tolia, Parthasarathy ...
MVA
2007
158views Computer Vision» more  MVA 2007»
13 years 6 months ago
Hybrid object labelling in digital images
The application of a technique for labelling connected components based on the classical recursive technique is studied. The recursive approach permits labelling, counting, and cha...
Julio Martín-Herrero
IPMI
2009
Springer
14 years 8 months ago
Persistence Diagrams of Cortical Surface Data
We present a novel framework for characterizing signals in images using techniques from computational algebraic topology. This technique is general enough for dealing with noisy mu...
Moo K. Chung, Peter Bubenik, Peter T. Kim
COMPGEOM
2004
ACM
14 years 23 days ago
Time-varying reeb graphs for continuous space-time data
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
Herbert Edelsbrunner, John Harer, Ajith Mascarenha...