417 search results - page 13 / 84 » Fast Methods for Solving Linear Diophantine Equations |
JVCA
2006
13 years 8 months ago
2006
The triangle-to-triangle intersection test is a basic component of all collision detection data structures and algorithms. This paper presents a fast method for testing whether tw...
ISPAN
2002
IEEE
14 years 1 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
MOC
1998
13 years 8 months ago
1998
On the basis of a fully discrete trigonometric Galerkin method and two grid iterations we propose solvers for integral and pseudodifferential equations on closed curves which solv...
NA
2006
13 years 8 months ago
2006
A least-squares spectral collocation scheme is combined with the overlapping Schwarz method. The methods are succesfully applied to the incompressible Navier-Stokes equations. The...
CHES
2005
Springer
2005
Springer
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
14 years 2 months ago
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...