2631 search results - page 86 / 527 » A Practical Method for the Sparse Resultant |
PDP
1995
IEEE
15 years 1 months ago
1995
IEEE
We investigate the parallel implementation of the diagonal{implicitly iterated Runge{ Kutta (DIIRK) method, an iteration method based on a predictor{corrector scheme. This method ...
100
click to vote
CVPR
2005
IEEE
16 years 11 hour ago
2005
IEEE
Thin plate spline (TPS) transformations have been applied to non-rigid shape matching with impressive results. However, existing methods often use a sparse set of point correspond...
ITICSE
2003
ACM
15 years 3 months ago
2003
ACM
The high variability of students’ backgrounds typically found in introductory programming courses creates additional difficulties to foster motivation and ensure the desired co...
105
click to vote
PDP
2005
IEEE
15 years 3 months ago
2005
IEEE
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
AAAI
2006
14 years 11 months ago
2006
We show in this paper that the influential algorithm of iterative belief propagation can be understood in terms of exact inference on a polytree, which results from deleting enoug...