6393 search results - page 264 / 1279 » Randomized Algorithms on the Mesh |
191
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
179
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
177
click to vote
SIGKDD
2002
15 years 6 months ago
2002
Suppose there are many clients, each having some personal information, and one server, which is interested only in aggregate, statistically significant, properties of this informa...
315
click to vote
POPL
2003
ACM
16 years 6 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
234
click to vote
RECOMB
2001
Springer
16 years 6 months ago
2001
Springer
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...