849 search results - page 99 / 170 » Completely Non-malleable Schemes |
IJNSEC
2006
13 years 10 months ago
2006
Over the past few years a number of research papers about reversible watermarks has been produced. Reversible watermarking is a novel category of watermarking schemes. It not only...
TCOM
2008
13 years 10 months ago
2008
In this paper, we derive closed form upper bounds on the error probability of low-density parity-check (LDPC) coded modulation schemes operating on quasi-static fading channels. Th...
CISS
2010
IEEE
13 years 1 months ago
2010
IEEE
—Recovery of sparse signals from noisy observations is a problem that arises in many information processing contexts. LASSO and the Dantzig selector (DS) are two well-known schem...
CACM
1999
13 years 9 months ago
1999
stractions underlying distributed computing. We attempted to keep our preaims at an abstract and general level. In this column, we make those claims more concrete. More precisely, ...
ISCA
2002
IEEE
13 years 9 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...