Sciweavers

227 search results - page 2 / 46
» Complexity Results for Compressing Optimal Paths
Sort
View
ICIP
2007
IEEE
14 years 7 months ago
Analysis of the Decoding-Complexity of Compressed Image-Based Scene Representations
Interactive navigation in image-based scenes requires random access to the compressed reference image data. When using state of the art block-based hybrid video coding techniques,...
Ingo Bauermann, Eckehard G. Steinbach
DCOSS
2005
Springer
13 years 11 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
POPL
2007
ACM
14 years 6 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi
DATE
2005
IEEE
172views Hardware» more  DATE 2005»
13 years 11 months ago
Evolutionary Optimization in Code-Based Test Compression
We provide a general formulation for the code-based test compression problem with fixed-length input blocks and propose a solution approach based on Evolutionary Algorithms. In c...
Ilia Polian, Alejandro Czutro, Bernd Becker
ICIP
2006
IEEE
14 years 7 months ago
Psnr-Based Optimization of JPEG Baseline Compression on Color Images
A fast rate-distortion analytical framework for the PSNR-based optimization of JPEG baseline compression on color images is proposed in this paper. The analysis is conducted in th...
Linfeng Guo, Yan Meng