Sciweavers

254 search results - page 29 / 51
» The Gaussian Many-Help-One Distributed Source Coding Problem
Sort
View
TIT
2010
138views Education» more  TIT 2010»
13 years 2 months ago
Functional compression through graph coloring
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
Vishal Doshi, Devavrat Shah, Muriel Médard,...
KDD
2007
ACM
132views Data Mining» more  KDD 2007»
14 years 7 months ago
A scalable modular convex solver for regularized risk minimization
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
Choon Hui Teo, Alex J. Smola, S. V. N. Vishwanatha...
TIT
2008
80views more  TIT 2008»
13 years 7 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
ISSTA
2006
ACM
14 years 1 months ago
Improving distributed memory applications testing by message perturbation
We present initial work on perturbation techniques that cause the manifestation of timing-related bugs in distributed memory Message Passing Interface (MPI)-based applications. Th...
Richard W. Vuduc, Martin Schulz, Daniel J. Quinlan...
INFOCOM
2010
IEEE
13 years 5 months ago
Topological Properties Affect the Power of Network Coding in Decentralized Broadcast
—There exists a certain level of ambiguity regarding whether network coding can further improve download performance in P2P content distribution systems, as compared to commonly ...
Di Niu, Baochun Li