Sciweavers

5215 search results - page 660 / 1043
» Quantum clustering algorithms
Sort
View
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
15 years 6 months ago
How Fast Is the k-Means Method?
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 ...
Sariel Har-Peled, Bardia Sadri
COLING
2002
15 years 6 months ago
Topic Detection Based on Dialogue History
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-...
Takayuki Nakata, Shinichi Ando, Akitoshi Okumura
167
Voted
CORR
2002
Springer
95views Education» more  CORR 2002»
15 years 6 months ago
Qualitative Visualization of Distance Information
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...
Jobst Heitzig
IVC
2002
192views more  IVC 2002»
15 years 6 months ago
Understanding visual behaviour
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...
Shaogang Gong, Hilary Buxton
SAC
2008
ACM
15 years 6 months ago
Discovering relationships among categories using misclassification information
Knowledge of relationships among categories is of the interest in different domains such as text classification, content analysis, and text mining. We propose and evaluate approac...
Saket S. R. Mengle, Nazli Goharian, Alana Platt