Sciweavers

273 search results - page 46 / 55
» Compressed String Dictionaries
Sort
View
MSV
2004
13 years 9 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 7 months ago
Where is Randomness Needed to Break the Square-Root Bottleneck?
As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all th...
Patrick Kuppinger, Giuseppe Durisi, Helmut Bö...
IJCV
2008
88views more  IJCV 2008»
13 years 7 months ago
On the Local Behavior of Spaces of Natural Images
In this study we concentrate on qualitative topological analysis of the local behavior of the space of natural images. To this end, we use a space of 3 by 3 high-contrast patches ...
Gunnar Carlsson, Tigran Ishkhanov, Vin de Silva, A...
VLDB
1987
ACM
92views Database» more  VLDB 1987»
13 years 11 months ago
Mind Your Grammar: a New Approach to Modelling Text
Beginning to create the New Oxford English Dictionary database has resulted in the realization that databases for reference texts are unlike those for conventional enterprises. Wh...
Gaston H. Gonnet, Frank Wm. Tompa
PPOPP
2003
ACM
14 years 29 days ago
Compactly representing parallel program executions
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
Ankit Goel, Abhik Roychoudhury, Tulika Mitra