790 search results - page 61 / 158 » Subexponential Parameterized Algorithms |
111
click to vote
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
158
click to vote
PG
2007
IEEE
15 years 9 months ago
2007
IEEE
We introduce an algorithm for approximating a 2manifold 3D mesh by a set of developable surfaces. Each developable surface is a generalized cylinder represented as a strip of tria...
140
click to vote
COCOON
2010
Springer
15 years 6 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
372
click to vote
PRL
2010
15 years 1 months ago
2010
We consider the problem of fitting linearly parameterized models, that arises in many computer vision problems such as road scene analysis. Data extracted from images usually cont...
135
click to vote
SCN
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...