4009 search results - page 354 / 802 » Clustering on Complex Graphs |
187
click to vote
TON
2010
15 years 5 months ago
2010
Abstract—In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tr...
148
click to vote
COMPGEOM
2006
ACM
16 years 23 days ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
181
click to vote
GI
2004
Springer
16 years 5 days ago
2004
Springer
: With the growing complexity of parallel architectures, the probability of system failures grows, too. One approach to cope with this problem is the self-healing, one of the organ...
205
click to vote
IJBRA
2008
15 years 6 months ago
2008
: Identifying functional modules is believed to reveal most cellular processes. There have been many computational approaches to investigate the underlying biological structures [2...
177
click to vote
TCS
2010
15 years 5 months ago
2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...