2219 search results - page 161 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
127
Voted
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
210
Voted
IJCV
2006
15 years 2 months ago
2006
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
127
Voted
ICPP
2008
IEEE
15 years 9 months ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
125
Voted
ICPR
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper, a method to automatically extract the main information from a long-term electrocardiographic signal is presented. This method is based on techniques of pattern reco...
153
click to vote
ICRA
2000
IEEE
15 years 7 months ago
2000
IEEE
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...