Sciweavers

619 search results - page 28 / 124
» Generic Extensions and Generic Polynomials
Sort
View
CVPR
2010
IEEE
14 years 1 months ago
Polynomial Shape from Shading
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects....
Ady Ecker, Allan Jepson
MKM
2009
Springer
14 years 2 months ago
A Logically Saturated Extension of
This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Autexier [4] on ¯λµ˜µ, a calculus introduced by Curien and Herbelin [5,6]. Jus...
Lionel Elie Mamane, Herman Geuvers, James McKinna
MP
2010
150views more  MP 2010»
13 years 2 months ago
The algebraic degree of semidefinite programming
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...
Jiawang Nie, Kristian Ranestad, Bernd Sturmfels
WAE
2001
223views Algorithms» more  WAE 2001»
13 years 9 months ago
An Adaptable and Extensible Geometry Kernel
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects...
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvai...
IMCSIT
2010
13 years 5 months ago
Semi-Automatic Extension of Morphological Lexica
Abstract--We present a tool that facilitates the efficient extension of morphological lexica. The tool exploits information from a morphological lexicon, a morphological grammar an...
Tobias Kaufmann, Beat Pfister