125
click to vote
SSPR
2000
Springer
15 years 7 months ago
2000
Springer
In many applications, objects are represented by a collection of unorganized points that scan the surface of the object. In such cases, an efficient way of storing this information...
134
click to vote
SSPR
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. For many statistical pattern recognition methods, distributions of sample vectors are assumed to be normal, and the quadratic discriminant function derived from the proba...
127
click to vote
COCOC
1995
15 years 7 months ago
1995
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
155
click to vote
COCO
1995
Springer
15 years 7 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...