1322 search results - page 154 / 265 » Parameterized counting problems |
123
click to vote
JCO
2010
15 years 1 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
140
Voted
NETWORKS
2010
15 years 1 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...
149
Voted
SIAMSC
2010
15 years 29 days ago
2010
We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the ha...
156
Voted
ICCV
2011
IEEE
14 years 2 months ago
2011
IEEE
We propose a novel statistical manifold modeling approach that is capable of classifying poses of object categories from video sequences by simultaneously minimizing the intra-cla...
118
Voted
WOTE
2010
15 years 28 days ago
2010
Optical mark-sense scanning has lead to a resurgence in the use of paper ballots in the United States, despite a century of strong competition from paperless direct-recording votin...