Sciweavers

6 search results - page 1 / 2
» A general computation rule for lossy summaries messages with...
Sort
View
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 7 months ago
A general computation rule for lossy summaries/messages with examples from equalization
Abstract-- Elaborating on prior work by Minka, we formulate a general computation rule for lossy messages. An important special case (with many applications in communications) is t...
Junli Hu, Hans-Andrea Loeliger, Justin Dauwels, Fr...
ICAS
2009
IEEE
147views Robotics» more  ICAS 2009»
14 years 2 months ago
Fast Estimation of Aggregates in Unstructured Networks
Aggregation of data values plays an important role on distributed computations, in particular over peer-to-peer and sensor networks, as it can provide a summary of some global sys...
Carlos Baquero, Paulo Sérgio Almeida, Raque...
POPL
2003
ACM
14 years 7 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
COMPUTER
2000
180views more  COMPUTER 2000»
13 years 7 months ago
The Challenges of Automatic Summarization
tion--the art of abstracting key content from one or more information sources--has become an integral part of everyday life. People keep abreast of world affairs by listening to ne...
Udo Hahn, Inderjeet Mani
LICS
2007
IEEE
14 years 1 months ago
A Complete Axiomatization of Knowledge and Cryptography
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
Mika Cohen, Mads Dam