2219 search results - page 327 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
138
Voted
COCOA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
108
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
115
click to vote
RECOMB
2009
Springer
16 years 3 months ago
2009
Springer
Prediction and alignment of RNA pseudoknot structures are NP-hard. Nevertheless, several efficient prediction algorithms by dynamic programming have been proposed for restricted cl...
137
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
141
Voted
AI
2002
Springer
15 years 2 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...