452 search results - page 36 / 91 » On Weighting Clustering |
109
click to vote
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
126
click to vote
KDD
2010
ACM
15 years 3 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
TSD
2005
Springer
15 years 5 months ago
2005
Springer
Cluster analysis of dialogs with transport directory service allows revealing the typical scenarios of dialogs, which is useful for designing automatic dialog systems. We show how ...
ICCD
2003
IEEE
15 years 8 months ago
2003
IEEE
: Most of the recently discussed and commercially introduced test stimulus data compression techniques are based on low care bit densities found in typical scan test vectors. Data ...
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract— We perform spectral analysis of the Internet topology at the AS level, by adapting the standard spectral filtering method of examining the eigenvectors corresponding t...