6365 search results - page 225 / 1273 » Fast Local Computation Algorithms |
167
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
137
Voted
GD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Timetable graphs are used to analyze transportation networks. In their visualization, vertex coordinates are fixed to preserve the underlying geography, but due to small ...
166
click to vote
ISM
2008
IEEE
16 years 25 days ago
2008
IEEE
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
143
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We present a shape matching algorithm based on the chamfer distance transform which can be easily integrated into the well-known SIFT framework. The shape matching was designed to...
196
click to vote
VC
2008
15 years 6 months ago
2008
This paper presents a novel and fast image-space collision detection algorithm with the A-buffer, where the GPU computes the potentially colliding sets (PCSs), and the CPU performs...