1291 search results - page 19 / 259 » Computing the multiplicity structure in solving polynomial s... |
BIRTHDAY
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invar...
FUIN
2000
13 years 7 months ago
2000
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
ICVGIP
2004
13 years 9 months ago
2004
This paper presents several results on images of various configurations of conics. We extract information about the plane from single and multiple views of known and unknown conic...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
ECCV
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...