1051 search results - page 127 / 211 » Single Run Optimization Using the Reverse-Simulation Method |
115
click to vote
ACCV
2006
Springer
15 years 10 months ago
2006
Springer
We present a new method for recovering the 3D shape of a featureless smooth surface from three or more calibrated images. The main contribution of this paper is the ability to hand...
167
Voted
KES
1999
Springer
15 years 9 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
149
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
139
click to vote
IFL
1997
Springer
15 years 8 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
139
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...