750 search results - page 18 / 150 » Reconstruction for Models on Random Graphs |
HLK
2003
IEEE
14 years 1 months ago
2003
IEEE
It’s common experience for human vision to perceive full 3D shape and scene from a single 2D image with the occluded parts “filled-in” by prior visual knowledge. In this pa...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
ALENEX
2003
13 years 9 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...