2600 search results - page 209 / 520 » Clustering with or without the Approximation |
121
click to vote
HPCN
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. The parallel implementation of GCR is addressed, with particular focus on communication costs associated with orthogonalization processes. This consideration brings up qu...
191
click to vote
ESANN
1997
15 years 8 months ago
1997
Besides their topological properties, Kohonen maps are often used for vector quantization only. These auto-organised networks are often compared to other standard and/or adaptive v...
196
click to vote
ALGORITHMICA
1999
15 years 6 months ago
1999
We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. O...
181
click to vote
ICTAI
2009
IEEE
15 years 4 months ago
2009
IEEE
The selection of features for classification, clustering and approximation is an important task in pattern recognition, data mining and soft computing. For real-valued features, th...
200
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...