Sciweavers

11212 search results - page 532 / 2243
» Semi-persistent Data Structures
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 9 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
IMR
2003
Springer
16 years 5 days 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 1 months 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...
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
15 years 10 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
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...