Sciweavers

15792 search results - page 230 / 3159
» Computational Abstraction Steps
Sort
View
CAGD
2007
75views more  CAGD 2007»
15 years 7 months ago
Computing roots of polynomials by quadratic clipping
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
Michael Barton, Bert Jüttler
IACR
2011
124views more  IACR 2011»
14 years 6 months ago
Group Law Computations on Jacobians of Hyperelliptic Curves
We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the g...
Craig Costello, Kristin Lauter
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
16 years 21 days ago
Evolutionary computation methods for synchronization of effects based operations
Effects based operations (EBO) is a concept based on the premise that a desired strategic outcome can be achieved through synergistic, multiplicative, and cumulative application ...
Jeffrey P. Ridder
CCCG
2003
15 years 8 months ago
Computing Delaunay Triangulation with Imprecise Input Data
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside t...
Ali Asghar Khanban, Abbas Edalat
ICIP
2010
IEEE
15 years 5 months ago
Statistical modeling of the lung nodules in low dose computed tomography scans of the chest
This work presents a novel approach in automatic detection of the lung nodules and is compared with respect to parametric nodule models in terms of sensitivity and specificity. A ...
Amal A. Farag, James Graham, Salwa Elshazly, Aly F...