2570 search results - page 121 / 514 » Fast Algorithms For The Computation Of Ranklets |
CGF
2007
14 years 10 months ago
2007
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
IPPS
2002
IEEE
15 years 3 months ago
2002
IEEE
This paper presents a self-adapting parallel package for computing the Walsh-Hadamard transform (WHT), a prototypical fast signal transform, similar to the fast Fourier transform....
79
Voted
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, a fast motion estimation algorithm for variable block-size by using a motion vector merging procedure is proposed for H.264. The motion vectors of adjacent small bl...
103
Voted
SOFSEM
2007
Springer
15 years 4 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...