Sciweavers

1695 search results - page 92 / 339
» Linear, Polynomial or Exponential
Sort
View
CORR
2011
Springer
176views Education» more  CORR 2011»
14 years 11 months ago
Inner approximations for polynomial matrix inequalities and robust stability regions
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
Didier Henrion, Jean B. Lasserre
ICCV
2001
IEEE
16 years 5 months ago
A Linear Dual-Space Approach to 3D Surface Reconstruction from Occluding Contours using Algebraic Surfaces
We present a linear approach to the 3D reconstruction problem from occluding contours using algebraic surfaces. The problem of noise and missing data in the occluding contours extr...
Kongbin Kang, Jean-Philippe Tarel, Richard Fishman...
ISSAC
2009
Springer
141views Mathematics» more  ISSAC 2009»
15 years 10 months ago
Algorithms for regular solutions of higher-order linear differential systems
We study systems of higher-order linear differential equations having a regular singularity at the origin. Using the properties of matrix polynomials, we develop efficient method...
Moulay A. Barkatou, Thomas Cluzeau, Carole El Bach...
MOC
2010
14 years 11 months ago
hp-Optimal discontinuous Galerkin methods for linear elliptic problems
Abstract. The aim of this paper is to present and analyze a class of hpversion discontinuous Galerkin (DG) discretizations for the numerical approximation of linear elliptic proble...
Benjamin Stamm, Thomas P. Wihler
AAAI
1997
15 years 5 months ago
Worst-Case Absolute Loss Bounds for Linear Learning Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. I demonstrateworst-case upper bounds on the absolute loss for the perceptron algorithm and ...
Tom Bylander