Sciweavers

1855 search results - page 55 / 371
» A coding theorem for distributed computation
Sort
View
LCN
2007
IEEE
14 years 5 months ago
Efficient MD Coding Core Selection to Reduce the Bandwidth Consumption
- Multiple distribution trees and multiple description (MD) coding are highly robust since they provide redundancy both in network paths and data. However, MD coded streaming inclu...
Sunoh Choi, Sang-Seon Byun, Chuck Yoo
CORR
1999
Springer
138views Education» more  CORR 1999»
13 years 10 months ago
A simple proof of the unconditional security of quantum key distribution
Quantum key distribution is the best known application of quantum cryptography. Previously proposed proofs of security of quantum key distribution contain various technical subtle...
Hoi-Kwong Lo
SDM
2008
SIAM
97views Data Mining» more  SDM 2008»
14 years 17 days ago
Efficient Distribution Mining and Classification
We define and solve the problem of "distribution classification", and, in general, "distribution mining". Given n distributions (i.e., clouds) of multi-dimensi...
Yasushi Sakurai, Rosalynn Chong, Lei Li, Christos ...
BIRTHDAY
2005
Springer
14 years 4 months ago
Term Rewriting Meets Aspect-Oriented Programming
We explore the connection between term rewriting systems (TRS) and aspect-oriented programming (AOP). Term rewriting is a paradigm that is used in fields such as program transform...
Paul Klint, Tijs van der Storm, Jurgen J. Vinju
INFOCOM
2008
IEEE
14 years 5 months ago
Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?
Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information proc...
Patrick Denantes, Florence Bénézit, ...