2137 search results - page 380 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
129
click to vote
CP
2011
Springer
14 years 1 months ago
2011
Springer
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
111
click to vote
SIROCCO
2010
15 years 3 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
159
click to vote
CP
2003
Springer
15 years 7 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
123
click to vote
CIBCB
2006
IEEE
15 years 8 months ago
2006
IEEE
— Successful biological image analysis usually requires satisfactory segmentations to identify regions of interest as an intermediate step. Here we present a novel graphical mode...
117
click to vote
SIGIR
2006
ACM
15 years 8 months ago
2006
ACM
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...