Sciweavers

203 search results - page 38 / 41
» On interpolation by radial polynomials
Sort
View
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
14 years 29 days ago
Algorithms for the non-monic case of the sparse modular GCD algorithm
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈   [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
Jennifer de Kleine, Michael B. Monagan, Allan D. W...
ICB
2009
Springer
163views Biometrics» more  ICB 2009»
14 years 2 days ago
Active Fingerprint Ridge Orientation Models
This paper proposes a statistical model for fingerprint ridge orientations. The active fingerprint ridge orientation model (AFROM) iteratively deforms to fit the orientation fi...
Surinder Ram, Horst Bischof, Josef A. Birchbauer
IPCO
2007
98views Optimization» more  IPCO 2007»
13 years 9 months ago
On a Generalization of the Master Cyclic Group Polyhedron
We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron. We present an explicit characterization of t...
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günl&uu...
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
13 years 7 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 7 months ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah