961 search results - page 41 / 193 » Significance-Driven Graph Clustering |
102
Voted
KDD
2007
ACM
16 years 1 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
115
click to vote
EUROPAR
2004
Springer
15 years 6 months ago
2004
Springer
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
107
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
106
click to vote
ACL
2006
15 years 2 months ago
2006
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. I...
118
Voted
TC
2010
14 years 11 months ago
2010
— Although data prefetching algorithms have been extensively studied for years, there is no counterpart research done for metadata access performance. Existing data prefetching a...