2219 search results - page 170 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
104
Voted
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
We propose a new approach to estimate gait kinematics from image sequences taken by a monocular uncalibrated camera. This approach involves two generative models for gait represen...
151
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
101
Voted
CP
2008
Springer
15 years 4 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
169
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
224
Voted
POPL
2009
ACM
16 years 3 months ago
2009
ACM
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...