2219 search results - page 202 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
140
click to vote
HIPC
2005
Springer
15 years 8 months ago
2005
Springer
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
131
click to vote
GD
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the...
126
click to vote
FCCM
2000
IEEE
15 years 7 months ago
2000
IEEE
Simplifying the programming models is paramount to the success of reconfigurable computing. We apply the principles of object-oriented programming to the design of stream archite...
111
click to vote
CVPR
2000
IEEE
15 years 7 months ago
2000
IEEE
We present a novel approach for learning patterns (sub-images) shared by multiple images without prior knowledge about the number and the positions of the patterns in the images. ...
127
Voted
ICCAD
2001
IEEE
16 years 1 days ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...