Sciweavers

4455 search results - page 241 / 891
» The family and communication technologies
Sort
View
CORR
2008
Springer
91views Education» more  CORR 2008»
15 years 6 months ago
Exchange of Limits: Why Iterative Decoding Works
We consider communication over a family of binary-input memoryless output-symmetric channels using lowdensity parity-check codes under message passing decoding. The asymptotic (in ...
Satish Babu Korada, Rüdiger L. Urbanke
DPD
2006
123views more  DPD 2006»
15 years 6 months ago
Reducing network traffic in unstructured P2P systems using Top-k queries
A major problem of unstructured P2P systems is their heavy network traffic. This is caused mainly by high numbers of query answers, many of which are irrelevant for users. One solu...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
CORR
2007
Springer
149views Education» more  CORR 2007»
15 years 6 months ago
Graph Entropy, Network Coding and Guessing games
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
Søren Riis
TIT
2008
86views more  TIT 2008»
15 years 6 months ago
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
Michael B. Baer
CCR
2004
113views more  CCR 2004»
15 years 6 months ago
Implementing aggregation and broadcast over Distributed Hash Tables
Peer-to-peer (P2P) networks represent an effective way to share information, since there are no central points of failure or bottleneck. However, the flip side to the distributive...
Ji Li, Karen R. Sollins, Dah-Yoh Lim