760 search results - page 57 / 152 » Algorithms for finding clique-transversals of graphs |
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
While the majority of competitive image segmentation methods are based on energy minimization, only few allow to efficiently determine globally optimal solutions. A graphtheoretic...
COCOA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
RECOMB
2007
Springer
14 years 9 months ago
2007
Springer
Currently, large-scale projects are underway to perform whole genome disease association studies. Such studies involve the genotyping of hundreds of thousands of SNP markers. One o...
WABI
2001
Springer
14 years 1 months ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...