Sciweavers

114 search results - page 21 / 23
» Compression of a Dictionary
Sort
View
AC
2003
Springer
14 years 18 days ago
Generic Haskell: Applications
Generic Haskell is an extension of Haskell that supports the construction of generic programs. These lecture notes discuss three advanced generic programming applications: generic ...
Ralf Hinze, Johan Jeuring
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...
ICIP
2009
IEEE
14 years 8 months ago
Reconstructing Ft-ir Spectroscopic Imaging Data With A Sparse Prior
Fourier Transform Infrared (FT-IR) spectroscopic imaging is a potentially valuable tool for diagnosing breast and prostate cancer, but its clinical deployment is limited due to lo...
MSV
2004
13 years 8 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ö...