905 search results - page 24 / 181 » On the Complexity of uSPR Distance |
CEC
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
SMA
2003
ACM
14 years 1 months ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
ICIP
1998
IEEE
14 years 10 months ago
1998
IEEE
We develope a technique to perform e cient and accurate matching to detect the occurences of a template in a scene. The template may describe an object or a textured surface. Repr...