1322 search results - page 45 / 265 » Parameterized counting problems |
125
Voted
MST
2007
15 years 2 months ago
2007
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
110
click to vote
DAGSTUHL
2007
15 years 4 months ago
2007
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
127
click to vote
COLT
1993
Springer
15 years 6 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
120
Voted
MIG
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Motion blending is a popular motion synthesis technique which interpolates similar motion examples according to blending weighs parameterizing high-level characteristics ...
127
Voted
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...