2219 search results - page 104 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
210
click to vote
ISCA
2002
IEEE
15 years 1 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
120
click to vote
FCCM
2002
IEEE
15 years 7 months ago
2002
IEEE
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
125
click to vote
WEA
2005
Springer
15 years 7 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
132
Voted
ESA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
137
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...