Sciweavers

2219 search results - page 79 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
ICCV
1999
IEEE
15 years 3 days ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
ICPR
2010
IEEE
13 years 10 months ago
Dynamic Hand Pose Recognition Using Depth Data
—Hand pose recognition has been a problem of great interest to the Computer Vision and Human Computer Interaction community for many years and the current solutions either requir...
Poonam Suryanarayan, Anbumani Subramanian, Dinesh ...
ISSPIT
2010
13 years 5 months ago
Accelerating the Nussinov RNA folding algorithm with CUDA/GPU
Graphics processing units (GPU) on commodity video cards have evolved into powerful computational devices. The RNA secondary structure arises from the primary structure and a backb...
Dar-Jen Chang, Christopher Kimmer, Ming Ouyang
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
13 years 7 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
LICS
2009
IEEE
14 years 4 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp