Sciweavers

14158 search results - page 373 / 2832
» Generalized switch-setting problems
Sort
View
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
15 years 11 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
CPM
2007
Springer
94views Combinatorics» more  CPM 2007»
15 years 11 months ago
Finding Witnesses by Peeling
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...
Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, ...
WG
2009
Springer
15 years 11 months ago
Exact and Parameterized Algorithms for Max Internal Spanning Tree
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
Henning Fernau, Serge Gaspers, Daniel Raible
CDC
2008
IEEE
111views Control Systems» more  CDC 2008»
15 years 6 months ago
A Hamiltonian approximation method for the reduction of controlled systems
Abstract-- This paper considers the problem of model reduction for controlled systems. The paper considers a dual/adjoint formulation of the general optimization problem to minimiz...
Siep Weiland
NIPS
2008
15 years 6 months ago
Non-parametric Regression Between Manifolds
This paper discusses non-parametric regression between Riemannian manifolds. This learning problem arises frequently in many application areas ranging from signal processing, comp...
Florian Steinke, Matthias Hein