296 search results - page 29 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
CVGIP
2008
14 years 9 months ago
2008
Wang Tiles are constructed from four texture samples, arranged so they can always match a choice of other tiles at two edges. Because they are precomputed, Wang Tiles are a very e...
CVPR
2005
IEEE
15 years 11 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...
118
click to vote
ECCV
2008
Springer
15 years 8 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
ICTAI
2010
IEEE
14 years 7 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...