Sciweavers

14161 search results - page 361 / 2833
» On generalized middle-level problem
Sort
View
WG
2009
Springer
16 years 1 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 8 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 8 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
DAGSTUHL
2006
15 years 8 months ago
Constraint Satisfaction with Succinctly Specified Relations
Abstract. The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the liter...
Hubie Chen, Martin Grohe
MOR
2006
123views more  MOR 2006»
15 years 6 months ago
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
Nikhil Bansal, José R. Correa, Claire Kenyo...