Sciweavers

12 search results - page 2 / 3
» When indexing equals compression: experiments with compressi...
Sort
View
FOCS
2000
IEEE
13 years 10 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
LCTRTS
2005
Springer
13 years 11 months ago
A dictionary construction technique for code compression systems with echo instructions
Dictionary compression mechanisms identify redundant sequences of instructions that occur in a program. The sequences are extracted and copied to a dictionary. Each sequence is th...
Philip Brisk, Jamie Macbeth, Ani Nahapetian, Majid...
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 6 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
ESTIMEDIA
2007
Springer
13 years 10 months ago
Still Image Processing on Coarse-Grained Reconfigurable Array Architectures
Due to the increasing demands on efficiency, performance and flexibility reconfigurable computational architectures are very promising candidates in embedded systems design. Recent...
Matthias Hartmann, Vasileios (Vassilis) Pantazis, ...
RTCSA
2007
IEEE
14 years 16 days ago
A Continuous Query Index for Processing Queries on RFID Data Stream
RFID middleware systems collect and filter RFID streaming data gathered continuously by numerous readers to process requests from applications. These requests are called continuou...
Jaekwan Park, Bonghee Hong, ChaeHoon Ban