77 search results - page 3 / 16 » Sampling directed graphs with random walks |
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
With more than 250 million active users, Facebook (FB) is currently one of the most important online social networks. Our goal in this paper is to obtain a representative (unbiased...
RT
1998
Springer
13 years 9 months ago
1998
Springer
The paper presents a single-pass, view-dependent method to solve the general rendering equation, using a combined finite element and random walk approach. Applying finite element t...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
ICML
2007
IEEE
14 years 6 months ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...