750 search results - page 13 / 150 » Reconstruction for Models on Random Graphs |
COMPGEOM
2011
ACM
13 years 19 hour ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
DCC
2001
IEEE
14 years 8 months ago
2001
IEEE
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
WWW
2004
ACM
14 years 9 months ago
2004
ACM
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
ICASSP
2011
IEEE
13 years 5 days ago
2011
IEEE
In this paper we discuss why a simple network topology inference algorithm based on network co-occurrence measurements and a Markov random walk model for routing enables perfect t...
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
This paper is concerned with the problem of dynamically reconstructing the 3D surface of an object undergoing non-rigid motion. The problem is cast as reconstructing a continuous ...