848 search results - page 8 / 170 » Randomness and the linear degrees of computability |
134
click to vote
RANDOM
2001
Springer
15 years 9 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...
140
click to vote
FOCS
2006
IEEE
15 years 11 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...
122
Voted
COMGEO
2008
ACM
15 years 5 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...
162
click to vote
DAM
2008
15 years 4 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...
144
click to vote
IPPS
2002
IEEE
15 years 10 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...