1057 search results - page 76 / 212 » Accelerating the LSTRS Algorithm |
104
Voted
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
119
Voted
SIGGRAPH
1994
ACM
15 years 4 months ago
1994
ACM
We present an approach for accelerating hierarchical radiosity by clustering objects. Previous approaches constructed effective hierarchies by subdividing surfaces, but could not ...
111
Voted
NIPS
2004
15 years 2 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
118
click to vote
MICRO
2010
IEEE
14 years 10 months ago
2010
IEEE
Wide Single Instruction, Multiple Thread (SIMT) architectures often require a static allocation of thread groups that are executed in lockstep throughout the entire application ker...
108
Voted
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Active contour models are among the most popular PDE-based tools in computer vision. In this paper we present a new algorithm for the fast evolution of geodesic active contours an...