312 search results - page 5 / 63 » Iterative compression and exact algorithms |
ICIP
2002
IEEE
14 years 1 months ago
2002
IEEE
Context-based adaptive entropy coding is an essential feature of modern image compression algorithms; however, the design of these coders is non-trivial due to the balance that mu...
ICASSP
2011
IEEE
13 years 8 days ago
2011
IEEE
Recent works in modified compressed sensing (CS) show that reconstruction of sparse or compressible signals with partially known support yields better results than traditional CS...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
JCO
2010
13 years 7 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...