5100 search results - page 844 / 1020 » The Linear Complexity of a Graph |
155
click to vote
DCC
2004
IEEE
16 years 6 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
154
click to vote
DCC
2003
IEEE
16 years 6 months ago
2003
IEEE
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...
151
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
173
click to vote
ICDCS
2009
IEEE
16 years 3 months ago
2009
IEEE
With the growing complexity in computer systems, it has been a real challenge to detect and diagnose problems in today’s large-scale distributed systems. Usually, the correlatio...
142
click to vote
ICCD
2006
IEEE
16 years 3 months ago
2006
IEEE
— In this paper, we present a comprehensive energy estimation framework for software executing on Very Long Instruction Word (VLIW) processor cores. The proposed energy model is ...