176 search results - page 26 / 36 » A Problem Kernelization for Graph Packing |
IJON
2006
13 years 7 months ago
2006
Non-stationary signal classification is a complex problem. This problem becomes even more difficult if we add the following hypothesis: each signal includes a discriminant wavefor...
DISOPT
2011
13 years 2 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
ICPP
1999
IEEE
13 years 12 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
NETWORKS
2010
13 years 6 months ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
ISBI
2009
IEEE
14 years 2 months ago
2009
IEEE
Understanding neural connectivity and structures in the brain requires detailed 3D anatomical models, and such an understanding is essential to the study of the nervous system. Ho...