790 search results - page 81 / 158 » Subexponential Parameterized Algorithms |
130
click to vote
VMV
2000
15 years 4 months ago
2000
In this paper the problem of matching freeform surface features against measured point data is studied. The motivation for this investigation is the recent demand for fast and rob...
196
click to vote
MFCS
2010
Springer
15 years 1 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
143
click to vote
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
131
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
111
click to vote
TIP
2008
15 years 3 months ago
2008
We provide a detailed analysis of the use of minimal spanning graphs as an alignment method for registering multimodal images. This yields an efficient graph theoretic algorithm th...