Sciweavers

3192 search results - page 437 / 639
» The minimum latency problem
Sort
View
EMMCVPR
2005
Springer
15 years 9 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
MFCS
2005
Springer
15 years 9 months ago
Complexity of DNF and Isomorphism of Monotone Formulas
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
Judy Goldsmith, Matthias Hagen, Martin Mundhenk
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 9 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
GD
2004
Springer
15 years 9 months ago
No-Three-in-Line-in-3D
The no-three-in-line problem, introduced by Dudeney in 1917, asks for the maximum number of points in the n × n grid with no three points collinear. In 1951, Erd¨os proved that t...
Attila Pór, David R. Wood
KES
2004
Springer
15 years 9 months ago
Extracting Stellar Population Parameters of Galaxies from Photometric Data Using Evolution Strategies and Locally Weighted Linea
There is now a huge amount of high quality photometric data available in the literature whose analysis is bound to play a fundamental role in studies of the formation and evolution...
Luis Alvarez, Olac Fuentes, Roberto Terlevich