848 search results - page 8 / 170 » Randomness and the linear degrees of computability |
RANDOM
2001
Springer
15 years 1 months ago
2001
Springer
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
77
Voted
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
COMGEO
2008
ACM
14 years 9 months ago
2008
ACM
A randomized linear expected-time algorithm for computing the zonoid depth (Dyckerhoff et al 1996, Mosler 2002) of a point with respect to a fixed dimensional point set is presente...
DAM
2008
14 years 9 months ago
2008
We consider {0, 1}n as a sample space with a probability measure on it, thus making pseudo-Boolean functions into random variables. We then derive explicit formulas for approximat...
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...