1511 search results - page 85 / 303 » Randomness, lowness and degrees |
182
click to vote
IPTPS
2003
Springer
15 years 11 months ago
2003
Springer
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
167
click to vote
CRYPTO
2007
Springer
16 years 11 days ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}...
162
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
146
click to vote
ICC
2007
IEEE
16 years 15 days ago
2007
IEEE
Abstract— Coverage is a fundamental problem in sensor networks. In this paper, we addressed the coverage problem from two different view points and refer to them as the worst and...
160
click to vote
CPC
2002
15 years 6 months ago
2002
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...