1494 search results - page 277 / 299 » Polynomial time algorithms for network information flow |
COMAD
2009
13 years 9 months ago
2009
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
TSP
2010
13 years 3 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— A control frame can be piggybacked in a data frame to increase the channel efficiency in a wireless communication such as IEEE 802.11 WLAN. However, the piggyback scheme may c...