Sciweavers

5580 search results - page 189 / 1116
» Randomized priority algorithms
Sort
View
81
Voted
CPC
2006
110views more  CPC 2006»
14 years 10 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
RSA
2008
80views more  RSA 2008»
14 years 9 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
93
Voted
CVPR
2004
IEEE
16 years 7 days 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, ...
CMSB
2006
Springer
15 years 1 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
CORR
2007
Springer
82views Education» more  CORR 2007»
14 years 10 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor