65 search results - page 13 / 13 » Mixing Time of Exponential Random Graphs |
TCC
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
TSP
2010
13 years 18 hour 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...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
PVLDB
2008
13 years 4 months ago
2008
The amount of biological data publicly available has experienced an exponential growth as the technology advances. Online databases are now playing an important role as informatio...