267 search results - page 15 / 54 » Anti-Ramsey properties of random graphs |
ANTSW
2010
Springer
13 years 6 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
The recently introduced random walker segmentation algorithm of [14] has been shown to have desirable theoretical properties and to perform well on a wide variety of images in pra...
MICCAI
2005
Springer
14 years 9 months ago
2005
Springer
This paper introduces a novel solver, namely cross entropy (CE), into the MRF theory for medical image segmentation. The solver, which is based on the theory of rare event simulati...