2219 search results - page 80 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
114
click to vote
IEEEPACT
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
126
click to vote
AAAI
2012
13 years 4 months ago
2012
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
159
click to vote
ERSHOV
2009
Springer
15 years 6 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
119
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
131
click to vote
CCS
2009
ACM
15 years 9 months ago
2009
ACM
In this paper, we present a new approach to performing important classes of genomic computations (e.g., search for homologous genes) that makes a significant step towards privacy...