376 search results - page 33 / 76 » Completely connected clustered graphs |
125
click to vote
AAAI
2011
14 years 1 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
112
click to vote
WSE
2003
IEEE
15 years 7 months ago
2003
IEEE
Reverse engineering techniques have the potential to support Web site understanding, by providing views that show the organization of a site and its navigational structure. Howeve...
112
click to vote
KDD
2004
ACM
16 years 2 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
121
click to vote
COLT
2007
Springer
15 years 8 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
127
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
The following three questions should be answered in developing new topology with more powerful ability to tolerate node-failure in wireless sensor network. First, what is node-fai...