Sciweavers

2219 search results - page 70 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
IEEEPACT
2007
IEEE
14 years 4 months ago
Error Detection Using Dynamic Dataflow Verification
Continued scaling of CMOS technology to smaller transistor sizes makes modern processors more susceptible to both transient and permanent hardware faults. Circuitlevel techniques ...
Albert Meixner, Daniel J. Sorin
SPIN
2009
Springer
14 years 4 months ago
Automatic Discovery of Transition Symmetry in Multithreaded Programs Using Dynamic Analysis
While symmetry reduction has been established to be an important technique for reducing the search space in model checking, its application in concurrent software verification is ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Cha...
ICIP
2010
IEEE
13 years 8 months ago
Reducing graphs in graph cut segmentation
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
Nicolas Lerme, François Malgouyres, Lucas L...
ICFP
2003
ACM
14 years 10 months ago
Iterative-free program analysis
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano
CVPR
2007
IEEE
15 years 5 days ago
Compositional Boosting for Computing Hierarchical Image Structures
In this paper, we present a compositional boosting algorithm for detecting and recognizing 17 common image structures in low-middle level vision tasks. These structures, called &q...
Tianfu Wu, Gui-Song Xia, Song Chun Zhu