Sciweavers

484 search results - page 47 / 97
» Computing Hilbert Class Polynomials
Sort
View
SIAMNUM
2010
126views more  SIAMNUM 2010»
13 years 3 months ago
Smoothing under Diffeomorphic Constraints with Homeomorphic Splines
In this paper we introduce a new class of diffeomorphic smoothers based on general spline smoothing techniques and on the use of some tools that have been recently developed in th...
Jérémie Bigot, Sébastien Gada...
AUTOMATICA
2008
167views more  AUTOMATICA 2008»
13 years 9 months ago
Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
CORR
2008
Springer
125views Education» more  CORR 2008»
13 years 8 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
2007
Springer
165views Education» more  CORR 2007»
13 years 8 months ago
Comparison of Tree-Child Phylogenetic Networks
Abstract—Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization...
Gabriel Cardona, Francesc Rosselló, Gabriel...
ICDCS
2002
IEEE
14 years 1 months ago
The Complexity of Adding Failsafe Fault-Tolerance
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
Sandeep S. Kulkarni, Ali Ebnenasir