Sciweavers

33 search results - page 1 / 7
» Algorithms for Modular Counting of Roots of Multivariate Pol...
Sort
View
ALGORITHMICA
2008
36views more  ALGORITHMICA 2008»
13 years 5 months ago
Algorithms for Modular Counting of Roots of Multivariate Polynomials
Parikshit Gopalan, Venkatesan Guruswami, Richard J...
JSC
2006
102views more  JSC 2006»
13 years 5 months ago
Counting and locating the solutions of polynomial systems of maximum likelihood equations, I
In statistics, mixture models consisting of several component subpopulations are used widely to model data drawn from heterogeneous sources. In this paper, we consider maximum lik...
Max-Louis G. Buot, Donald St. P. Richards
ICCV
2005
IEEE
13 years 11 months ago
How Hard is 3-View Triangulation Really?
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
Henrik Stewénius, Frederik Schaffalitzky, D...
EUROCRYPT
2004
Springer
13 years 11 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations Revisited
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
Jean-Sébastien Coron
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 2 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...