Sciweavers

86 search results - page 1 / 18
» Polytope-based computation of polynomial ranges
Sort
View
SAC
2010
ACM
13 years 11 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...
MVA
1992
128views Computer Vision» more  MVA 1992»
13 years 5 months ago
Computation of Surface Curvature from Range Images Using Geometrically Intrinsic Weights
This paper presents a method to compute Mean and Gaussian curvatures from range images. The first and second partial derivatives are estimated by the weighted least squares fit of...
Takio Kurita, Pierre Boulanger
TOMS
2010
106views more  TOMS 2010»
13 years 2 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
13 years 8 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
ASAP
1995
IEEE
145views Hardware» more  ASAP 1995»
13 years 8 months ago
An array processor for inner product computations using a Fermat number ALU
This paper explores an architecture for parallel independent computations of inner products over the direct product ring . The structure is based on the polynomial mapping of the ...
Wenzhe Luo, Graham A. Jullien, Neil M. Wigley, Wil...