5606 search results - page 115 / 1122 » Randomization Techniques for Graphs. |
WWW
2010
ACM
14 years 5 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
14 years 3 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...
COMPSAC
2003
IEEE
14 years 3 months ago
2003
IEEE
WAIM
2001
Springer
14 years 2 months ago
2001
Springer
PDP
1996
IEEE
14 years 2 months ago
1996
IEEE