1127 search results - page 131 / 226 » Value Compression for Efficient Computation |
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
This paper presents an algorithm to optimize the tradeoff between rate and expected end-to-end distortion of a video sequence transmitted over a packet network. The approach optim...
ESTIMEDIA
2007
Springer
15 years 1 months ago
2007
Springer
Due to the increasing demands on efficiency, performance and flexibility reconfigurable computational architectures are very promising candidates in embedded systems design. Recent...
NIPS
2008
14 years 11 months ago
2008
It has been shown that the problem of 1-penalized least-square regression commonly referred to as the Lasso or Basis Pursuit DeNoising leads to solutions that are sparse and there...
SAC
2002
ACM
14 years 9 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
126
click to vote
ICCS
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. The efficient use of multicore architectures for sparse matrixvector multiplication (SpMV) is currently an open challenge. One algorithm which makes use of SpMV is the ma...