Sciweavers

817 search results - page 16 / 164
» Robust Euclidean embedding
Sort
View
PPSN
2004
Springer
15 years 3 months ago
Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation
Abstract. This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps con...
Jano I. van Hemert, Neil Urquhart
KDD
2000
ACM
168views Data Mining» more  KDD 2000»
15 years 1 months ago
Scaling up dynamic time warping for datamining applications
There has been much recent interest in adapting data mining algorithms to time series databases. Most of these algorithms need to compare time series. Typically some variation of ...
Eamonn J. Keogh, Michael J. Pazzani
ITNG
2006
IEEE
15 years 3 months ago
A Decentralized Network Coordinate System for Robust Internet Distance
Network distance, measured as round-trip latency between hosts, is important for the performance of many Internet applications. For example, nearest server selection and proximity...
Li-wei Lehman, Steven Lerman
TSMC
2002
119views more  TSMC 2002»
14 years 9 months ago
Approximation of n-dimensional data using spherical and ellipsoidal primitives
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
Giuseppe Carlo Calafiore
ICPR
2008
IEEE
15 years 10 months ago
On refining dissimilarity matrices for an improved NN learning
Application-specific dissimilarity functions can be used for learning from a set of objects represented by pairwise dissimilarity matrices in this context. These dissimilarities m...
Elzbieta Pekalska, Robert P. W. Duin