6365 search results - page 245 / 1273 » Fast Local Computation Algorithms |
138
click to vote
SGP
2007
15 years 9 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...
193
click to vote
CGF
2010
15 years 6 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...
186
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
146
click to vote
ECCV
2006
Springer
15 years 10 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...
172
click to vote
ICS
2000
Tsinghua U.
15 years 10 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...