Sciweavers

3750 search results - page 287 / 750
» Code Optimization for Code Compression
Sort
View
CGF
2008
118views more  CGF 2008»
15 years 4 months ago
Image-Based Surface Compression
We present a generic framework for compression of densely sampled 3D surfaces in order to satisfy the increasing demand for storing large amounts of 3D content. We decompose a giv...
Tilo Ochotta, Dietmar Saupe
VLSID
2006
IEEE
136views VLSI» more  VLSID 2006»
16 years 4 months ago
Improved Data Compression for Serial Interconnected Network on Chip through Unused Significant Bit Removal
Serial links in network on chip provide advantages in terms of reduced wiring area, reduced switch complexity and power. However, serial links offer lower bandwidth in comparison ...
Simon Ogg, Bashir M. Al-Hashimi
ICMCS
2005
IEEE
128views Multimedia» more  ICMCS 2005»
15 years 10 months ago
Low-complexity automatic speaker recognition in the compressed GSM AMR domain
This paper presents an experimental implementation of a low-complexity speaker recognition algorithm working in the compressed speech domain. The goal is to perform speaker modeli...
Matteo Petracca, Antonio Servetti, Juan Carlos De ...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 10 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
TIT
2002
70views more  TIT 2002»
15 years 4 months ago
High-rate codes that are linear in space and time
Multiple-antenna systems that operate at high rates require simple yet effective space-time transmission schemes to handle the large traffic volume in real time. At rates of tens ...
Babak Hassibi, Bertrand M. Hochwald