5606 search results - page 183 / 1122 » Randomization Techniques for Graphs. |
97
Voted
MICCAI
2004
Springer
16 years 1 months ago
2004
Springer
This paper introduces a new technique to detect the coronary arteries as well as other heart's peripheral vessels. After finding the location of the myocardium through a graph...
102
Voted
FTCS
1998
15 years 2 months ago
1998
The traditional use of formal methods has been for the veri cation of algorithms or protocols. Given the high cost and limitations in state space coverage provided by conventional...
MVA
1998
15 years 2 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
109
click to vote
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
99
Voted
JCT
2007
15 years 17 days ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...