1145 search results - page 132 / 229 » Discrete Green's Functions |
158
click to vote
NCA
2005
IEEE
15 years 12 months ago
2005
IEEE
In systems where customer service demands are only known probabilistically, there is very little to distinguish between jobs. Therefore, no universal optimum scheduling strategy o...
166
click to vote
ASIACRYPT
2003
Springer
15 years 11 months ago
2003
Springer
The best practical algorithm for class group computations in imaginary quadratic number fields (such as group structure, class number, discrete logarithm computations) is a varian...
187
click to vote
IMR
2003
Springer
15 years 11 months ago
2003
Springer
The quality of numerical simulations of processes that are modeled by partial differential equations strongly depends on the quality of the mesh that is used for their discretiza...
203
click to vote
SGP
2004
15 years 8 months ago
2004
Providing a thorough mathematical foundation, multiresolution modeling is the standard approach for global surface deformations that preserve fine surface details in an intuitive ...
189
click to vote
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...