413 search results - page 50 / 83 » Computing Models for FPGA-Based Accelerators |
107
click to vote
CAGD
2004
14 years 11 months ago
2004
We consider the ICP (iterative closest point) algorithm, which may in general be used for moving `active' elements such as curves and surfaces towards geometric objects whose...
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
We describe a tracker that can track moving people in long sequences without manual initialization. Moving people are modeled with the assumption that, while configuration can var...
116
click to vote
CLUSTER
2009
IEEE
14 years 9 months ago
2009
IEEE
With the advent of high-performance COTS clusters, there is a need for a simple, scalable and faulttolerant parallel programming and execution paradigm. In this paper, we show that...
100
click to vote
SIGGRAPH
1993
ACM
15 years 3 months ago
1993
ACM
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generat...
118
click to vote
CCGRID
2001
IEEE
15 years 3 months ago
2001
IEEE
An inexpensive way to construct a scalable display wall system is to use a cluster of PCs with commodity graphics accelerators to drive an array of projectors. A challenge is to b...