13214 search results - page 408 / 2643 » Pseudorandomness for network algorithms |
191
click to vote
COMSNETS
2012
14 years 2 months ago
2012
—In this paper, we investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a cap...
202
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
A heterogeneous information network is an information network composed of multiple types of objects. Clustering on such a network may lead to better understanding of both hidden s...
196
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
—In a wireless sensor network, the network lifetime is an important issue when the size of the network is large. In order to make the network scalable, it is divided into a numbe...
171
click to vote
P2P
2007
IEEE
16 years 1 months ago
2007
IEEE
Structured overlay networks form a major class of peerto-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-s...
207
click to vote
GI
2004
Springer
16 years 8 days ago
2004
Springer
: This paper presents a data-centric and location-aware procedure to perform in-network evaluation of queries in sensor networks. The algorithm is a hybrid of geographic hash table...