4714 search results - page 300 / 943 » The Complexity of Iterated Multiplication |
164
click to vote
ESTIMEDIA
2004
Springer
16 years 1 days ago
2004
Springer
Abstract— This paper presents an exploration framework which performs data assignment and access scheduling exploration for applications given a multilayer memory architecture. O...
169
click to vote
ICALP
2004
Springer
16 years 1 days ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
171
click to vote
ICCSA
2004
Springer
16 years 1 days ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
150
click to vote
3DIM
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper addresses a registration refinement problem and presents an accurate and fast Point-to-(Tangent) Plane technique. Point-to-Plane approach is known to be very accurate ...
178
click to vote
IMR
2003
Springer
15 years 12 months ago
2003
Springer
We present a method for isotropic remeshing of arbitrary genus surfaces. The method is based on a mesh adaptation process, namely, a sequence of local modifications performed on ...