406 search results - page 20 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
IJFCS
2006
14 years 9 months ago
2006
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
AI
2010
Springer
14 years 9 months ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
87
Voted
ESCIENCE
2007
IEEE
15 years 3 months ago
2007
IEEE
As scientific workflows and the data they operate on, grow in size and complexity, the task of defining how those workflows should execute (which resources to use, where the resou...
JIIS
2006
14 years 9 months ago
2006
Kernel Canonical Correlation Analysis (KCCA) is a method of correlating linear relationship between two variables in a kernel defined feature space. A machine learning algorithm b...