82 search results - page 14 / 17 » On Exact Learning from Random Walk |
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Distributed message relaying is an important function of a peer-topeer system to discover service providers. Existing search protocols in unstructured peer-to-peer systems either ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
AAAI
2007
13 years 9 months ago
2007
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this pap...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...