Sciweavers

273 search results - page 38 / 55
» Compressed String Dictionaries
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
Bilevel sparse coding for coupled feature spaces
In this paper, we propose a bilevel sparse coding model for coupled feature spaces, where we aim to learn dictionaries for sparse modeling in both spaces while enforcing some desi...
Jianchao Yang, Zhaowen Wang, Zhe Lin, Xianbiao Shu...
CASES
2005
ACM
13 years 9 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton
ICIP
2000
IEEE
14 years 4 days ago
Low-Complexity Scalable DCT Image Compression
We have developed a scalable image compression scheme with a good performance-complexity trade-off. Like JPEG, it is based on the 8 × 8 block discrete cosine transform (DCT), but...
René J. van der Vleuten, Richard P. Kleihor...
VLDB
1993
ACM
138views Database» more  VLDB 1993»
13 years 11 months ago
Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
Justin Zobel, Alistair Moffat, Ron Sacks-Davis
DCC
2011
IEEE
13 years 2 months ago
Tree Structure Compression with RePair
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
Markus Lohrey, Sebastian Maneth, Roy Mennicke