2004 search results - page 197 / 401 » Sampling from large graphs |
122
Voted
TOOLS
2010
IEEE
15 years 8 months ago
2010
IEEE
Supporting read-only and side effect free execution has been the focus of a large body of work in the area of statically typed programming languages. Read-onlyness in dynamically t...
125
Voted
KDD
2010
ACM
15 years 7 months ago
2010
ACM
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely ...
145
Voted
ASUNAM
2010
IEEE
15 years 5 months ago
2010
IEEE
Real-world social networks from a variety of domains can naturally be modelled as dynamic graphs. However, approaches to detecting communities have largely focused on identifying ...
139
Voted
CGF
2010
15 years 3 months ago
2010
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
159
Voted
SAC
2002
ACM
15 years 3 months ago
2002
ACM
We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad hoc networks. Three components of thi...