1949 search results - page 157 / 390 » Random graphs on surfaces |
144
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
146
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
We present an algorithm for performing Lambertian photometric stereo in the presence of shadows. The algorithm has three novel features. First, a fast graph cuts based method is u...
265
Voted
VCBM
2010
14 years 11 months ago
2010
We present the latest developments in modeling 3D biomedical data via the Medial Scaffold (MS), a 3D acyclic oriented graph representation of the Medial Axis (MA) [LK07, SP08]. Th...
158
click to vote
JUCS
2008
15 years 4 months ago
2008
: In the paper we study parallel key exchange among multiple parties. The status of parallel key exchange can be depicted by a key graph. In a key graph, a vertex represents a part...
125
Voted
CAAN
2004
Springer
15 years 10 months ago
2004
Springer
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...