848 search results - page 143 / 170 » Randomness and the linear degrees of computability |
ICML
2008
IEEE
16 years 18 days ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
MOBIHOC
2009
ACM
16 years 10 days ago
2009
ACM
In this paper, we propose a practical scheme, called Non-Binary Joint Network-Channel Decoding (NB-JNCD) for reliable communication in wireless networks. It seamlessly couples cha...
113
click to vote
MSWIM
2009
ACM
15 years 6 months ago
2009
ACM
Most people-centric delay tolerant networks have been shown to exhibit power-law behavior. Analysis of the temporal connectivity graph of such networks reveals the existence of hu...
104
click to vote
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
131
click to vote
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...