Sciweavers

778 search results - page 105 / 156
» Bounding Smooth Integers
Sort
View
CORR
2011
Springer
186views Education» more  CORR 2011»
13 years 2 months ago
On the Complexity of Solving a Bivariate Polynomial System
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
Pavel Emeliyanenko, Michael Sagraloff
TCS
2011
13 years 2 months ago
Optimizing n-variate (n+k)-nomials for small k
We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n + 2)-nomial with a constant term, allowing real exponents as well as real...
Philippe P. Pébay, J. Maurice Rojas, David ...
ICCV
1998
IEEE
14 years 9 months ago
Wormholes in Shape Space: Tracking Through Discontinuous Changes in Shape
Existing object tracking algorithms generally use some form of local optimisation, assuming that an object's position and shape change smoothly over time. In some situations ...
Tony Heap, David Hogg
ECCV
2004
Springer
14 years 9 months ago
Region-Based Segmentation on Evolving Surfaces with Application to 3D Reconstruction of Shape and Piecewise Constant Radiance
Abstract. We consider the problem of estimating the shape and radiance of a scene from a calibrated set of images under the assumption that the scene is Lambertian and its radiance...
Hailin Jin, Anthony J. Yezzi, Stefano Soatto
ICML
2005
IEEE
14 years 8 months ago
Learning discontinuities with products-of-sigmoids for switching between local models
Sensorimotor data from many interesting physical interactions comprises discontinuities. While existing locally weighted learning approaches aim at learning smooth functions, we p...
Marc Toussaint, Sethu Vijayakumar