2004 search results - page 262 / 401 » Sampling from large graphs |
121
Voted
CCS
2008
ACM
15 years 4 months ago
2008
ACM
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
132
Voted
WWW
2007
ACM
16 years 3 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
119
click to vote
SIGCOMM
2009
ACM
15 years 9 months ago
2009
ACM
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
121
Voted
CGF
2008
15 years 2 months ago
2008
Visualizing pathways, i. e. models of cellular functional networks, is a challenging task in computer assisted biomedicine. Pathways are represented as large collections of interw...
106
click to vote
RSA
2010
15 years 1 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...