Sciweavers

677 search results - page 73 / 136
» On the reconstruction of perfect codes
Sort
View
ICASSP
2011
IEEE
14 years 1 months ago
A classifier-based decoding approach for large scale distributed coding
Canonical distributed quantization schemes do not scale to large sensor networks due to the exponential decoder storage complexity that they entail. Prior efforts to tackle this i...
Kumar Viswanatha, Sharadh Ramaswamy, Ankur Saxena,...
MOBISYS
2003
ACM
15 years 9 months ago
Tactics-Based Remote Execution for Mobile Computing
Remote execution can transform the puniest mobile device into a computing giant able to run resource-intensive applications such as natural language translation, speech recognitio...
Rajesh Krishna Balan, Mahadev Satyanarayanan, SoYo...
TIT
2008
80views more  TIT 2008»
14 years 9 months ago
Entropy Amplification Property and the Loss for Writing on Dirty Paper
Costa's celebrated "writing on dirty paper" (WDP) shows that the powerconstrained channel Y = X + S + Z, with Gaussian Z, has the same capacity as the standard AWGN...
Aaron S. Cohen, Ram Zamir
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
14 years 9 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
Anna Galluccio, Martin Loebl
ICIP
2002
IEEE
15 years 11 months ago
A proposal for high compression of faces in video sequences using adaptive eigenspaces
This paper presents a proposal for a novel video coding scheme intended to encode human faces in video sequences at very high compression using a recognition and reconstruction ap...
Luis Torres, Daniel Prado