1127 search results - page 117 / 226 » Value Compression for Efficient Computation |
CCGRID
2004
IEEE
15 years 1 months ago
2004
IEEE
Peer-to-peer environments have become popular as a framework for exchange of services. In these environments, certain peers may fail to provide their services. Reputation can be a...
CVPR
2007
IEEE
15 years 12 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
Arithmetic coding achieves a superior coding rate when encoding a binary source, but its lack of speed makes it an inferior choice when true high? performance encoding is needed. ...
72
Voted
DCC
1996
IEEE
15 years 2 months ago
1996
IEEE
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...
100
click to vote
TCSV
2010
14 years 4 months ago
2010
We describe a method for achieving perceptually minimal video distortion over packet-erasure networks using perceptually unequal loss protection (PULP). There are two main ingredie...