1101 search results - page 59 / 221 » An Algorithm for the Graph Crossing Number Problem |
136
click to vote
ICCV
2003
IEEE
16 years 4 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
96
Voted
WALCOM
2010
IEEE
15 years 9 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
136
click to vote
BMCBI
2010
15 years 2 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
117
Voted
SPAA
2009
ACM
15 years 9 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
120
click to vote
WEA
2005
Springer
15 years 8 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...