Sciweavers

385 search results - page 56 / 77
» Code Compression Using Variable-to-fixed Coding Based on Ari...
Sort
View
SIGIR
1998
ACM
14 years 28 days ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
ICFP
1997
ACM
14 years 27 days ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves
ICASSP
2008
IEEE
14 years 3 months ago
Model-based sparsity projection pursuit for lattice vector quantization
In this work we present an efficient coding scheme suitable for lossy image compression using a lattice vector quantizer (LVQ) based on statistically independent data projections...
Leonardo H. Fonteles, Marc Antonini, Ronald Phlypo
ICIP
2002
IEEE
14 years 10 months ago
Multiresolution 3D mesh compression
In this paper, we propose an efficient low complexity compression scheme for densely sampled irregular 3D meshes. This scheme is based on 3D multiresolution analysis (3D Discrete ...
Frédéric Payan, Marc Antonini
FUIN
1998
135views more  FUIN 1998»
13 years 8 months ago
A Study on Partitioned Iterative Function Systems for Image Compression
The technique of image compression using Iterative Function System (IFS) is known as fractal image compression. An extension of IFS theory is called as Partitioned or local Iterati...
Suman K. Mitra, C. A. Murthy, Malay Kumar Kundu