5606 search results - page 115 / 1122 » Randomization Techniques for Graphs. |
120
click to vote
WWW
2010
ACM
15 years 7 months ago
2010
ACM
PageRank computes the importance of each node in a directed graph under a random surfer model governed by a teleportation parameter. Commonly denoted alpha, this parameter models ...
ACSAC
2003
IEEE
15 years 6 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
63
Voted
COMPSAC
2003
IEEE
15 years 6 months ago
2003
IEEE
75
Voted
WAIM
2001
Springer
15 years 5 months ago
2001
Springer
122
Voted
PDP
1996
IEEE
15 years 4 months ago
1996
IEEE