Sciweavers

227 search results - page 4 / 46
» Complexity Results for Compressing Optimal Paths
Sort
View
FPL
2006
Springer
96views Hardware» more  FPL 2006»
15 years 2 months ago
Reducing the Space Complexity of Pipelined Routing Using Modified Range Encoding
Interconnect delays are becoming an increasingly significant part of the critical path delay for circuits implemented in FPGAs. Pipelined interconnects have been proposed to addre...
Allan Carroll, Carl Ebeling
72
Voted
DATE
2008
IEEE
134views Hardware» more  DATE 2008»
15 years 5 months ago
Adaptive Filesystem Compression for Embedded Systems
Abstract—Embedded system secondary storage size is often constrained, yet storage demands are growing as a result of increasing application complexity and storage of personal dat...
Lan S. Bai, Haris Lekatsas, Robert P. Dick
83
Voted
ICIP
2002
IEEE
16 years 21 days ago
Optimal protection assignment for scalable compressed images
This paper is concerned with the efficient transmission of scalable compressed images over lossy communication channels. Recent works have proposed several strategies for assignin...
Johnson Thie, David Taubman
ICIP
2003
IEEE
16 years 21 days ago
Optimal erasure protection assignment for scalable compressed images with tree-structured dependencies
This paper is concerned with the efficient transmission of scalable compressed images with complex dependency structures over lossy communication channels. Our recent work propose...
Johnson Thie, David Taubman
VCIP
2000
15 years 13 days ago
Optimal down-conversion in compressed DCT domain with minimal operations
A new down-conversion scheme in the DCT domain is presented, which can be used in decoders of DCT-compressed images and videos. The down-conversion in the transform domain general...
Myoung-Cheol Shin, In-Cheol Park