776 search results - page 63 / 156 » Network Applications of Graph Bisimulation |
AINA
2010
IEEE
14 years 2 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The ability to detect weak distributed activation patterns in networks is critical to several applications, such as identifying the onset of anomalous activity or incipient conges...
SIGMOD
2010
ACM
14 years 2 months ago
2010
ACM
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due ...
KDD
2012
ACM
12 years 15 days ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
KDD
2009
ACM
14 years 10 months ago
2009
ACM
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...