Sciweavers

28 search results - page 3 / 6
» On sign conditions over real multivariate polynomials
Sort
View
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
14 years 7 months ago
New degree bounds for polynomial threshold functions
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
Ryan O'Donnell, Rocco A. Servedio
ICCV
2005
IEEE
14 years 1 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...
ESA
2004
Springer
139views Algorithms» more  ESA 2004»
14 years 27 days ago
Comparing Real Algebraic Numbers of Small Degree
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
Ioannis Z. Emiris, Elias P. Tsigaridas
CASC
2011
Springer
212views Mathematics» more  CASC 2011»
12 years 7 months ago
Semi-algebraic Description of the Equilibria of Dynamical Systems
Abstract. We study continuous dynamical systems defined by autonomous ordinary differential equations, themselves given by parametric rational functions. For such systems, we pro...
Changbo Chen, Marc Moreno Maza
JC
2010
117views more  JC 2010»
13 years 2 months ago
Tractability through increasing smoothness
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithm...
Anargyros Papageorgiou, Henryk Wozniakowski