2570 search results - page 113 / 514 » Fast Algorithms For The Computation Of Ranklets |
85
Voted
SIGGRAPH
1994
ACM
15 years 2 months ago
1994
ACM
Several existing volume rendering algorithms operate by factoring the viewing transformation into a 3D shear parallel to the data slices, a projection to form an intermediate but ...
GD
2005
Springer
15 years 3 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
3DPVT
2006
IEEE
15 years 4 months ago
2006
IEEE
In this paper, we show the importance and feasibility of much faster multi-view stereo reconstruction algorithms relying almost exclusively on graphics hardware. Reconstruction al...
CF
2005
ACM
15 years 3 days ago
2005
ACM
In this paper we present a new organic computing principle denoted as marching pixels for the architectures of future smart CMOS camera chips. The idea of marching pixels is based...
ICCS
2009
Springer
15 years 4 months ago
2009
Springer
The limiting factor for efficiency of sparse linear solvers is the memory bandwidth. In this work, we utilize GPU’s high memory bandwidth for implementation of a sparse iterative...