23 search results - page 4 / 5 » Multicomplexes and polynomials with real zeros |
CORR
2012
Springer
12 years 6 months ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
MP
2006
13 years 10 months ago
2006
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points ...
EJC
2011
13 years 2 months ago
2011
Answering a question of B´ona, it is shown that for n ≥ 2 the probability that 1 and 2 are in the same cycle of a product of two n-cycles on the set {1, 2, . . . , n} is 1/2 if...
CVPR
2007
IEEE
15 years 27 days ago
2007
IEEE
Epipolar geometry and relative camera pose computation are examples of tasks which can be formulated as minimal problems and solved from a minimal number of image points. Finding ...
RECOMB
2004
Springer
14 years 11 months ago
2004
Springer
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...