263 search results - page 4 / 53 » Efficient Variants of the ICP Algorithm |
101
click to vote
ISVD
2007
IEEE
15 years 3 months ago
2007
IEEE
Jump flooding algorithm (JFA) is an interesting way to utilize the graphics processing unit to efficiently compute Voronoi diagrams and distance transforms in 2D discrete space. T...
FCCM
2009
IEEE
15 years 1 months ago
2009
IEEE
Scheduling and partitioning of task graphs on reconfigurable hardware needs to be carefully carried out in order to achieve the best possible performance. In this paper, we demons...
PAMI
2010
14 years 8 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
TOMS
2008
14 years 9 months ago
2008
This paper is concerned with the efficient numerical solution of the Lyapunov equation AT X +XA = -C with a stable matrix A and a symmetric positive semidefinite matrix C of possi...
75
Voted
TCS
2008
14 years 9 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...