905 search results - page 89 / 181 » On the Complexity of uSPR Distance |
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. T...
ICMCS
2005
IEEE
15 years 3 months ago
2005
IEEE
A solution for part segmentation of 3D objects is proposed in this paper. The approach is targeted to identify salient visual parts of a mesh by determining its main protrusions a...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
PAKDD
2005
ACM
15 years 3 months ago
2005
ACM
In several contexts and domains, hierarchical agglomerative clustering (HAC) offers best-quality results, but at the price of a high complexity which reduces the size of datasets ...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
In the Paired Pointset Traversal problem we ask whether, given two sets A = {a1, . . . , an} and B = {b1, . . . , bn} in the plane, there is an ordering π of the points such that ...