Sciweavers

2219 search results - page 168 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
PPOPP
2012
ACM
14 years 9 days ago
Internally deterministic parallel algorithms can be fast
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 ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
CVPR
2011
IEEE
15 years 26 days ago
Learning Message-Passing Inference Machines for Structured Prediction
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
Stephane Ross, Daniel Munoz, J. Andrew Bagnell
IEEECGIV
2005
IEEE
15 years 10 months ago
A Practical Implementation of a 3-D Game Engine
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...
Thomas C. S. Cheah, Kok-Why Ng
CVPR
2008
IEEE
16 years 6 months ago
Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration
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...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...
ICCD
2001
IEEE
121views Hardware» more  ICCD 2001»
16 years 1 months ago
Determining Schedules for Reducing Power Consumption Using Multiple Supply Voltages
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 ...
Noureddine Chabini, El Mostapha Aboulhamid, Yvon S...