Sciweavers

2843 search results - page 29 / 569
» Interpolation by geometric algorithm
Sort
View
CAP
2010
13 years 4 months ago
Parallel sparse polynomial interpolation over finite fields
We present a probabilistic algorithm to interpolate a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of Ben...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
CHARME
2005
Springer
130views Hardware» more  CHARME 2005»
14 years 3 months ago
Improvements to the Implementation of Interpolant-Based Model Checking
The evolution of SAT technology over the last decade has motivated its application in model checking, initially through the utilization of SAT in bounded model checking (BMC) and, ...
João P. Marques Silva
GECCO
2010
Springer
180views Optimization» more  GECCO 2010»
14 years 1 months ago
Comparison of NEWUOA with different numbers of interpolation points on the BBOB noisy testbed
In this paper, we study the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) with different numbers of interpolation points. NEWUOA is a trust region method, ...
Raymond Ros
GMP
2006
IEEE
130views Solid Modeling» more  GMP 2006»
14 years 3 months ago
Minimal Mean-Curvature-Variation Surfaces and Their Applications in Surface Modeling
Physical based and geometric based variational techniques for surface construction have been shown to be advanced methods for designing high quality surfaces in the fields of CAD ...
Guoliang Xu, Qin Zhang
ICIP
2009
IEEE
13 years 7 months ago
Two-dimensional geometric lifting
Wavelets provide a sparse representation for piecewise smooth signals in 1-D; however, separable extensions of wavelets to multiple dimensions do not achieve the same level of spa...
Joshua Blackburn, Minh N. Do