905 search results - page 3 / 181 » On the Complexity of uSPR Distance |
152
click to vote
ICML
2007
IEEE
16 years 6 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
146
Voted
CIAC
2006
Springer
15 years 9 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
127
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
94
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
151
click to vote
HEURISTICS
2007
15 years 5 months ago
2007
In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed in...