Sciweavers

116 search results - page 19 / 24
» End-to-end performance of randomized distributed space-time ...
Sort
View
CISS
2008
IEEE
15 years 3 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— 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...
Shirin Jalali, Tsachy Weissman
MM
2010
ACM
125views Multimedia» more  MM 2010»
14 years 9 months ago
Tenor: making coding practical from servers to smartphones
It has been theoretically shown that performing coding in networked systems, including Reed-Solomon codes, fountain codes, and random network coding, has a clear advantage with re...
Hassan Shojania, Baochun Li
INFOCOM
2005
IEEE
15 years 3 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 9 months ago
Linear Operator Channels over Finite Fields
Motivated by random linear network coding, we study the communication through channels, called linear operator channels (LOCs), that perform linear operation over finite fields. Fo...
Shenghao Yang, Siu-Wai Ho, Jin Meng, En-Hui Yang
NAA
2000
Springer
104views Mathematics» more  NAA 2000»
15 years 1 months ago
A Grid Free Monte Carlo Algorithm for Solving Elliptic Boundary Value Problems
In this work a grid free Monte Carlo algorithm for solving elliptic boundary value problems is investigated. The proposed Monte Carlo approach leads to a random process called a ba...
Todor V. Gurov, Paula A. Whitlock, Ivan Dimov