5096 search results - page 637 / 1020 » Landscape of Clustering Algorithms |
183
click to vote
VISSYM
2003
15 years 8 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
179
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
185
click to vote
COLING
2002
15 years 6 months ago
2002
In this paper, we propose a topic detection method using a dialogue history for selecting a scene in the automatic interpretation system (Ikeda et al., 2002). The method uses a k-...
169
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
172
click to vote
IVC
2002
15 years 6 months ago
2002
Modelling events is one of the key problems in dynamic scene analysis when salient and autonomous visual changes occuring in a scene need to be characterised effectively as meanin...