1629 search results - page 95 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
109
click to vote
CVPR
2004
IEEE
15 years 12 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
125
click to vote
TAINN
2005
Springer
15 years 3 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
ISCAS
2005
IEEE
15 years 3 months ago
2005
IEEE
Although many researches have investigated transparent scrambling video techniques, an issue of which transcoding relates to downsizing scrambled video without unscrambling has ha...
ICIP
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper describes a method for articulated upper body tracking in monocular scenes. The compatibility between model and the image is estimated using one particle filter for eac...
DAC
2000
ACM
15 years 11 months ago
2000
ACM
Joint module selection and retiming is a powerful technique to optimize the implementation cost and the speed of a circuit specified using a synchronous data-flow graph (DFG). In ...