1949 search results - page 197 / 390 » Random graphs on surfaces |
207
Voted
HLK
2003
IEEE
15 years 10 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...
159
click to vote
COMBINATORICS
2000
15 years 4 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
164
Voted
TCOS
2010
15 years 3 months ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
150
click to vote
KDD
2008
ACM
16 years 5 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...
157
Voted
GLOBECOM
2007
IEEE
15 years 11 months ago
2007
IEEE
—In this paper, we clarify inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (l-graph). Most of the interference graphs in the lit...