Sciweavers

5153 search results - page 68 / 1031
» Introduction to Randomized Algorithms
Sort
View
STOC
1998
ACM
115views Algorithms» more  STOC 1998»
15 years 2 months ago
On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
SODA
2008
ACM
59views Algorithms» more  SODA 2008»
14 years 11 months ago
Universality of random graphs
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vo...
SODA
1993
ACM
109views Algorithms» more  SODA 1993»
14 years 11 months ago
Dynamic Generation of Discrete Random Variates
Yossi Matias, Jeffrey Scott Vitter, Wen-Chun Ni
IJCNN
2006
IEEE
15 years 3 months ago
Predictive Random Graph Ranking on the Web
Abstract— The incomplete information about the Web structure causes inaccurate results of various ranking algorithms. In this paper, we propose a solution to this problem by form...
Haixuan Yang, Irwin King, Michael R. Lyu
APPROX
2005
Springer
80views Algorithms» more  APPROX 2005»
15 years 3 months ago
On Learning Random DNF Formulas Under the Uniform Distribution
Abstract: We study the average-case learnability of DNF formulas in the model of learning from uniformly distributed random examples. We define a natural model of random monotone ...
Jeffrey C. Jackson, Rocco A. Servedio