Sciweavers

11213 search results - page 316 / 2243
» Low-contention data structures
Sort
View
IMR
2003
Springer
15 years 12 months ago
Compact Representations of Simplicial Meshes in Two and Three Dimensions
We describe data structures for representing simplicial meshes compactly while supporting online queries and updates efficiently. Our data structure requires about a factor of fi...
Daniel K. Blandford, Guy E. Blelloch, David E. Car...
TACAS
2007
Springer
74views Algorithms» more  TACAS 2007»
16 years 24 days ago
Shape Analysis by Graph Decomposition
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
Roman Manevich, Josh Berdine, Byron Cook, G. Ramal...
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 8 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
JUCS
2008
165views more  JUCS 2008»
15 years 6 months ago
Shortcut Fusion of Monadic Programs
: Functional programs often combine separate parts of the program using intermediate data structures for communicating results. Programs so defined are easier to understand and mai...
Cecilia Manzino, Alberto Pardo
BMCBI
2011
14 years 10 months ago
The Proteogenomic Mapping Tool
Background: High-throughput mass spectrometry (MS) proteomics data is increasingly being used to complement traditional structural genome annotation methods. To keep pace with the...
William S. Sanders, Nan Wang, Susan M. Bridges, Br...