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...
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...
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...
Yanlai Chen, Jan S. Hesthaven, Yvon Maday, Jer&oac...
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...
Liang Mei, Jingen Liu, Alfred Hero, Silvio Savares...
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...