2570 search results - page 141 / 514 » Fast Algorithms For The Computation Of Ranklets |
141
click to vote
HCW
2000
IEEE
15 years 7 months ago
2000
IEEE
Recently, we presented two very low-cost approaches to compile-time list scheduling where the tasks’ priorities are computed statically or dynamically, respectively. For homogen...
148
click to vote
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The sparse representation has been widely used in many areas and utilized for visual tracking. Tracking with sparse representation is formulated as searching for samples ...
161
click to vote
JGTOOLS
2006
15 years 3 months ago
2006
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
129
Voted
ICIP
2004
IEEE
16 years 5 months ago
2004
IEEE
The goal of this work is to find a fast method for motion estimation and motion segmentation. We chose to decompose the motion on a basis functions. That allows us to compute the ...
127
click to vote
SI3D
2009
ACM
15 years 10 months ago
2009
ACM
Lines drawn over or in place of shaded 3D models can often provide greater comprehensibility and stylistic freedom that shading alone. A substantial challenge for making stylized ...