7228 search results - page 520 / 1446 » From Algorithmic to Subjective Randomness |
207
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
200
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
205
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...
228
click to vote
MIDDLEWARE
2004
Springer
16 years 8 days ago
2004
Springer
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
171
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...