3068 search results - page 142 / 614 » Clustering with Multiple Graphs |
133
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
By the term "quantization", we refer to the process of using quantum mechanics in order to improve a classical algorithm, usually by making it go faster. In this paper, ...
HT
1997
ACM
15 years 8 months ago
1997
ACM
A large hypertext net with node-to-node links can be interesting as a system of unities of meaning formed by node clusters, such that nodes in each of them are orderable into a co...
127
Voted
COMBINATORICS
2006
15 years 4 months ago
2006
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
129
Voted
ICDM
2005
IEEE
15 years 9 months ago
2005
IEEE
We introduce a robust and efficient framework called CLUMP (CLustering Using Multiple Prototypes) for unsupervised discovery of structure in data. CLUMP relies on finding multip...
140
click to vote
PDP
2006
IEEE
15 years 10 months ago
2006
IEEE
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performanc...