860 search results - page 73 / 172 » Biased Random Walks |
124
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
115
Voted
CCS
2009
ACM
15 years 7 months ago
2009
ACM
Peer-to-peer approaches to anonymous communication promise to eliminate the scalability concerns and central vulnerability points of current networks such as Tor. However, the P2P...
INFOCOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
143
Voted
ERCIMDL
2010
Springer
15 years 1 months ago
2010
Springer
Abstract Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In t...
CORR
2008
Springer
15 years 24 days ago
2008
Springer
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...