2570 search results - page 142 / 514 » Fast Algorithms For The Computation Of Ranklets |
108
Voted
SGP
2007
15 years 5 months ago
2007
We present two methods for lossy compression of normal vectors through quantization using "base" polyhedra. The first revisits subdivision-based quantization. The second...
148
click to vote
CGF
2010
15 years 3 months ago
2010
We present a new hybrid CPU/GPU collision detection technique for rigid and deformable objects based on spatial subdivision. Our approach efficiently exploits the massive computat...
108
Voted
ECCV
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents a semi-automatic method for tracking the mitral valve leaflet in transesophageal echocardiography. The algorithm requires a manual initialization and then segme...
124
Voted
ICS
2000
Tsinghua U.
15 years 7 months ago
2000
Tsinghua U.
Loop fusion is important to optimizing compilers because it is an important tool in managing the memory hierarchy. By fusing loops that use the same data elements, we can reduce t...
117
click to vote
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
An algorithm is presented for the geometric analysis of an algebraic curve f(x, y) = 0 in the real affine plane. It computes a cylindrical algebraic decomposition (CAD) of the pla...