Sciweavers

5153 search results - page 147 / 1031
» Introduction to Randomized Algorithms
Sort
View
98
Voted
COCO
2010
Springer
148views Algorithms» more  COCO 2010»
15 years 6 months ago
Derandomizing from Random Strings
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
Harry Buhrman, Lance Fortnow, Michal Koucký...
116
Voted
CPC
2006
110views more  CPC 2006»
15 years 2 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
108
Voted
RSA
2008
80views more  RSA 2008»
15 years 2 months ago
A spectral technique for random satisfiable 3CNF formulas
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...
Abraham Flaxman
CVPR
2004
IEEE
16 years 4 months ago
Multiscale Conditional Random Fields for Image Labeling
We propose an approach to include contextual features for labeling images, in which each pixel is assigned to one of a finite set of labels. The features are incorporated into a p...
Miguel Á. Carreira-Perpiñán, ...
112
Voted
CMSB
2006
Springer
15 years 6 months ago
Randomization and Feedback Properties of Directed Graphs Inspired by Gene Networks
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
M. Cosentino Lagomarsino, P. Jona, B. Bassetti