Sciweavers

10 search results - page 1 / 2
» On the Structure of Cubic and Quartic Polynomials
Sort
View
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 2 months ago
On the Structure of Cubic and Quartic Polynomials
In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the foll...
Elad Haramaty and Amir Shpilka
RSA
2008
123views more  RSA 2008»
13 years 4 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
ICCV
2011
IEEE
12 years 5 months ago
Generalized Roof Duality for Pseudo-Boolean Optimization
The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to red...
Fredrik Kahl, Petter Strandmark
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
13 years 9 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
JCAM
2011
78views more  JCAM 2011»
12 years 8 months ago
Symmetric box-splines on root lattices
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
Minho Kim, Jörg Peters