Sciweavers

855 search results - page 47 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
SIGGRAPH
1996
ACM
15 years 1 months ago
A Volumetric Method for Building Complex Models from Range Images
A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: i...
Brian Curless, Marc Levoy
PARA
2004
Springer
15 years 3 months ago
A Domain Theoretic Account of Euler's Method for Solving Initial Value Problems
Abstract. This paper presents a method of solving initial value problems using Euler’s method, based on the domain of interval valued functions of a real variable. In contrast to...
Abbas Edalat, Dirk Pattinson
ANTS
2006
Springer
105views Algorithms» more  ANTS 2006»
15 years 1 months ago
A Modular Method for Computing the Splitting Field of a Polynomial
We provide a modular method for computing the splitting field Kf of an integral polynomial f by suitable use of the byproduct of computation of its Galois group Gf by p-adic Staudu...
Guénaël Renault, Kazuhiro Yokoyama
MOC
1998
85views more  MOC 1998»
14 years 9 months ago
Remarks on the Schoof-Elkies-Atkin algorithm
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
L. Dewaghe
SC
1995
ACM
15 years 1 months ago
Predicting Application Behavior in Large Scale Shared-memory Multiprocessors
In this paper we present an analytical-based framework for parallel program performance prediction. The main thrust of this work is to provide a means for treating realistic appli...
Karim Harzallah, Kenneth C. Sevcik