Sciweavers

196 search results - page 23 / 40
» A finite set of functions with an EXPTIME-complete compositi...
Sort
View
BIRTHDAY
2010
Springer
15 years 24 days ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
CORR
2010
Springer
198views Education» more  CORR 2010»
14 years 8 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
CORR
2008
Springer
125views Education» more  CORR 2008»
14 years 11 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre
CORR
2008
Springer
72views Education» more  CORR 2008»
14 years 11 months ago
Statistical Learning of Arbitrary Computable Classifiers
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
David Soloveichik
CDC
2010
IEEE
210views Control Systems» more  CDC 2010»
14 years 6 months ago
Advances in moving horizon estimation for nonlinear systems
In the past decade, moving horizon estimation (MHE) has emerged as a powerful technique for estimating the state of a dynamical system in the presence of nonlinearities and disturb...
Angelo Alessandri, Marco Baglietto, Giorgio Battis...