2570 search results - page 31 / 514 » Fast Algorithms For The Computation Of Ranklets |
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
ICRA
2010
IEEE
14 years 8 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...
RTSS
2007
IEEE
15 years 4 months ago
2007
IEEE
ICPR
2002
IEEE
15 years 2 months ago
2002
IEEE
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
The Smith-Waterman (SW) algorithm is one of the widely used algorithms for sequence alignment in computational biology. With the growing size of the sequence database, there is alw...