Sciweavers

360 search results - page 6 / 72
» Precision-at-ten considered redundant
Sort
View
ICIP
2003
IEEE
14 years 9 months ago
Redundant representation with complex wavelets: how to achieve sparsity
Overcomplete transforms, like the Dual-Tree Complex Wavelet Transform, offer more flexible signal representations than critically-sampled transforms, due to their properties of sh...
Nick G. Kingsbury, Tanya Reeves
TR
2008
117views more  TR 2008»
13 years 7 months ago
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
Alain Billionnet
ICASSP
2009
IEEE
13 years 5 months ago
Joint optimization of the redundancy of multiple-description coders for multicast
We consider the optimization of multicast over packet-switched communication networks with a non-zero packet-loss probability. For the system setup consisting of a number of multi...
Ermin Kozica, W. Bastiaan Kleijn
ASPDAC
2005
ACM
114views Hardware» more  ASPDAC 2005»
13 years 9 months ago
Redundant-via enhanced maze routing for yield improvement
- Redundant via insertion is a good solution to reduce the yield loss by via failure. However, the existing methods are all post-layout optimizations that insert redundant via afte...
Gang Xu, Li-Da Huang, David Z. Pan, Martin D. F. W...
DCC
1996
IEEE
13 years 11 months ago
On the Implementation of Minimum-Redundancy Prefix Codes
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
Alistair Moffat, Andrew Turpin