Sciweavers

16 search results - page 1 / 4
» Benchmarking Coding Algorithms for the R-tree Compression
Sort
View
DATESO
2009
158views Database» more  DATESO 2009»
13 years 2 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
VTS
2002
IEEE
106views Hardware» more  VTS 2002»
13 years 9 months ago
How Effective are Compression Codes for Reducing Test Data Volume?
Run-length codes and their variants have recently been shown to be very effective for compressing system-on-achip (SOC) test data. In this paper, we analyze the Golomb code, the c...
Anshuman Chandra, Krishnendu Chakrabarty, Rafael A...
JMM2
2007
82views more  JMM2 2007»
13 years 4 months ago
Towards A Multi-Terminal Video Compression Algorithm By Integrating Distributed Source Coding With Geometrical Constraints
Abstract— In this paper, we present a framework for multiterminal video compression (MTVC) that exploits the geometric constraints between cameras with overlapping fields of vie...
Bi Song, Ertem Tuncel, Amit K. Roy Chowdhury
CASES
2006
ACM
13 years 10 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
FPL
2008
Springer
207views Hardware» more  FPL 2008»
13 years 5 months ago
Bitstream compression techniques for Virtex 4 FPGAs
This paper examines the opportunity of using compression for accelerating the (re)configuration of FPGA devices, focusing on the choice of compression algorithms, and their hardwa...
Radu Stefan, Sorin Dan Cotofana