1067 search results - page 126 / 214 » Probabilistic regular graphs |
107
Voted
ALGORITHMICA
2007
15 years 23 days ago
2007
The unit ball random geometric graph G = Gd p(λ, n) has as its vertices n points distributed independently and uniformly in the unit ball in Rd, with two vertices adjacent if and ...
121
click to vote
CORR
2007
Springer
15 years 18 days ago
2007
Springer
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
113
Voted
IPMI
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path...
93
Voted
GD
2004
Springer
15 years 6 months ago
2004
Springer
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
110
Voted
GD
1999
Springer
15 years 4 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...