3250 search results - page 19 / 650 » Parameterized Learning Complexity |
134
Voted
SIAMCOMP
2010
14 years 9 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
120
click to vote
RSCTC
2000
Springer
15 years 6 months ago
2000
Springer
The optimization of rough set based classification models with respect to parameterized balance between a model's complexity and confidence is discussed. For this purpose, the...
128
Voted
CPM
2005
Springer
15 years 8 months ago
2005
Springer
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
111
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
122
Voted
ICRA
2002
IEEE
15 years 7 months ago
2002
IEEE
This paper presents an approach to learning an optimal behavioral parameterization in the framework of a Case-Based Reasoning methodology for autonomous navigation tasks. It is ba...