Sciweavers

363 search results - page 4 / 73
» Finding Small Solutions to Small Degree Polynomials
Sort
View
MOC
1998
61views more  MOC 1998»
13 years 7 months ago
Polynomials with small Mahler measure
Abstract. We describe several searches for polynomials with integer coefficients and small Mahler measure. We describe the algorithm used to test Mahler measures. We determine all...
Michael J. Mossinghoff
AI
2011
Springer
12 years 11 months ago
Finding Small Backdoors in SAT Instances
Although propositional satisfiability (SAT) is NP-complete, state-of-the-art SAT solvers are able to solve large, practical instances. The concept of backdoors has been introduced...
Zijie Li, Peter van Beek
ECCV
2006
Springer
14 years 9 months ago
A Simple Solution to the Six-Point Two-View Focal-Length Problem
Abstract. This paper presents a simple and practical solution to the 6-point 2view focal-length estimation problem. Based on the hidden-variable technique we have derived a 15th de...
Hongdong Li
SIAMJO
2008
108views more  SIAMJO 2008»
13 years 7 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
13 years 7 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof