3422 search results - page 113 / 685 » Random Subset Optimization |
141
Voted
WSC
2008
15 years 5 months ago
2008
We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number...
135
Voted
ICRA
2009
IEEE
15 years 14 days ago
2009
IEEE
Contextual reasoning through graphical models such as Markov Random Fields often show superior performance against local classifiers in many domains. Unfortunately, this performanc...
122
Voted
ICCV
2007
IEEE
16 years 4 months ago
2007
IEEE
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...
140
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
119
Voted
STOC
1994
ACM
15 years 6 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...