5580 search results - page 253 / 1116 » Randomized priority algorithms |
180
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
186
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Detection of short, subtle conserved motif regions within a set of related DNA or amino acid sequences can lead to discoveries about important regulatory domains such ...
167
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
172
click to vote
RSA
2008
15 years 5 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
203
click to vote
VTC
2010
IEEE
15 years 4 months ago
2010
IEEE
—In wireless sensor networks (WSN), stochastic node dropping and unpredictable node failure greatly impair coverage, creating sensing holes, while locally redundant sensors exist...