Sciweavers

1067 search results - page 105 / 214
» cluster 2005
Sort
View
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
15 years 15 days 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
CAGD
2005
130views more  CAGD 2005»
15 years 14 days ago
Truly selective polygonal mesh hierarchies with error control
In this work a new multi-resolution model is proposed for polygonal meshes. It is based on the dual edge collapse, which performs face clustering instead of vertex clustering. The...
Stefan Gumhold
CIKM
2005
Springer
15 years 6 months ago
Query workload-aware overlay construction using histograms
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...
112
Voted
MICAI
2005
Springer
15 years 6 months ago
Modelling Human Intelligence: A Learning Mechanism
We propose a novel, high-level model of human learning and cognition, based on association forming. The model configures any input data stream featuring a high incidence of repeti...
Enrique Carlos Segura, Robin W. Whitty
96
Voted
IDA
2005
Springer
15 years 6 months ago
From Local Pattern Mining to Relevant Bi-cluster Characterization
Clustering or bi-clustering techniques have been proved quite useful in many application domains. A weakness of these techniques remains the poor support for grouping characterizat...
Ruggero G. Pensa, Jean-François Boulicaut