2219 search results - page 153 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
105
Voted
ICML
2003
IEEE
16 years 3 months ago
2003
IEEE
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
109
Voted
JNW
2006
15 years 2 months ago
2006
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...
135
Voted
BPM
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a ...
141
Voted
ICPR
2002
IEEE
16 years 3 months ago
2002
IEEE
Bayesian networks are an attractive modeling tool for human sensing, as they combine an intuitive graphical representation with ef?cient algorithms for inference and learning. Ear...
127
Voted
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...