Sciweavers

5115 search results - page 54 / 1023

» On Randomized Lanczos Algorithms

126

STOC
2002
ACM

73views Algorithms» more STOC 2002»

Solving convex programs by random walks

16 years 6 months ago

Solving convex programs by random walks

Download www-math.mit.edu

Dimitris Bertsimas, Santosh Vempala

claim paper

Read More »

117

WADS
2005
Springer

88views Algorithms» more WADS 2005»

Approximating the Online Set Multicover Problems via Randomized Winnowing

15 years 11 months ago

Approximating the Online Set Multicover Problems via Randomized Winnowing

Download www.cs.uic.edu

Piotr Berman, Bhaskar DasGupta

claim paper

Read More »

126

COCO
2001
Springer

101views Algorithms» more COCO 2001»

Resolution Complexity of Independent Sets in Random Graphs

15 years 10 months ago

Resolution Complexity of Independent Sets in Random Graphs

Download www.cs.cornell.edu

Paul Beame, Russell Impagliazzo, Ashish Sabharwal

claim paper

Read More »

125

STOC
1997
ACM

91views Algorithms» more STOC 1997»

Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets

15 years 10 months ago

Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets

Download www.cs.umd.edu

Peter Auer, Philip M. Long, Aravind Srinivasan

claim paper

Read More »

142

COCO
1994
Springer

86views Algorithms» more COCO 1994»

Random Strings Make Hard Instances

15 years 10 months ago

Random Strings Make Hard Instances

Download www.tcs.hut.fi

Harry Buhrman, Pekka Orponen

claim paper

Read More »

« Prev « First page 54 / 1023 Last » Next »