Sciweavers

34 search results - page 5 / 7
» On Miniaturized Problems in Parameterized Complexity Theory
Sort
View
CDC
2009
IEEE
127views Control Systems» more  CDC 2009»
13 years 10 months ago
A new perspective on control of uncertain complex systems
— In this article, we investigate a new class of control problems called Ensemble Control, a notion coming from the study of complex spin dynamics in Nuclear Magnetic Resonance (...
Shin Li
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
14 years 4 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
ALDT
2009
Springer
186views Algorithms» more  ALDT 2009»
14 years 2 months ago
The Complexity of Probabilistic Lobbying
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
Gábor Erdélyi, Henning Fernau, Judy ...
COLT
1993
Springer
13 years 11 months ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 4 months ago
Regression on fixed-rank positive semidefinite matrices: a Riemannian approach
The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space...
Gilles Meyer, Silvere Bonnabel, Rodolphe Sepulchre