Sciweavers

2735 search results - page 38 / 547
» Comparing notions of randomness
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
Luis Rademacher, Santosh Vempala
MICS
2010
134views more  MICS 2010»
13 years 6 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 9 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
DAM
2008
88views more  DAM 2008»
13 years 7 months ago
Stochastic applications of media theory: Random walks on weak orders or partial orders
This paper presents the axioms of a real time random walk on the set of states of a medium and some of their consequences, such as the asymptotic probabilities of the states. The ...
Jean-Claude Falmagne, Yung-Fong Hsu, Fabio Leite, ...
ICALP
2009
Springer
14 years 7 months ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
Sudipto Guha, Zhiyi Huang