67 search results - page 13 / 14 » Finding Strongly Knit Clusters in Social Networks |
KDD
2007
ACM
14 years 5 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
BIOCOMP
2008
13 years 6 months ago
2008
We introduce a novel parameter called container flux, which is used to measure the information sharing capacity between two distinct nodes in a graph. Other useful information, bot...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
BMCBI
2010
13 years 5 months ago
2010
Background: Homology is a crucial concept in comparative genomics. The algorithm probably most widely used for homology detection in comparative genomics, is BLAST. Usually a stri...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We conducted a preliminary field study to understand the current state of personal digital archiving in practice. Our aim is to design a service for the long-term storage, preserv...