2219 search results - page 168 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
130
click to vote
PPOPP
2012
ACM
13 years 10 months ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
151
Voted
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
164
Voted
IEEECGIV
2005
IEEE
15 years 8 months ago
2005
IEEE
Creating a 3-D game engine is not a trivial task as gamers often demand for high quality output with top notch performance in games. In this paper, we show you how various real-ti...
130
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
123
Voted
ICCD
2001
IEEE
15 years 11 months ago
2001
IEEE
Dynamic power is the main source of power consumption in CMOS circuits. It depends on the square of the supply voltage. It may significantly be reduced by scaling down the supply ...