Sciweavers

18 search results - page 1 / 4
» Alphabet Partitioning for Compressed Rank Select and Applica...
Sort
View
ISAAC
2010
Springer
245views Algorithms» more  ISAAC 2010»
13 years 3 months ago
Alphabet Partitioning for Compressed Rank/Select and Applications
Jérémy Barbay, Travis Gagie, Gonzalo...
ICIP
2007
IEEE
13 years 11 months ago
Compression Optimized Tracing of Digital Curves using Graph Theory
The use of an alphabet of line segments to compose a curve is a possible approach for curve data compression. An existing state-of-the-art method considers a quadtree decompositio...
András Hajdu, Ioannis Pitas
ATS
2002
IEEE
108views Hardware» more  ATS 2002»
13 years 10 months ago
Fault Set Partition for Efficient Width Compression
In this paper, we present a technique for reducing the test length of counter-based pseudo-exhaustive built-in self-testing (BIST) based on width compression method. More formally...
Emil Gizdarski, Hideo Fujiwara
DCC
2002
IEEE
14 years 4 months ago
PPMexe: PPM for Compressing Software
With the emergence of software delivery platforms such as Microsoft's .NET, code compression has become one of the core enabling technologies strongly affecting system perfor...
Milenko Drinic, Darko Kirovski
SPIRE
2010
Springer
13 years 3 months ago
Succinct Representations of Dynamic Strings
The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the stri...
Meng He, J. Ian Munro