5153 search results - page 835 / 1031 » Introduction to Randomized Algorithms |
179
Voted
SIAMCOMP
2011
14 years 10 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
148
click to vote
PODC
2011
ACM
14 years 6 months ago
2011
ACM
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
133
click to vote
ISPA
2005
Springer
15 years 8 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
146
click to vote
COCO
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
143
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...