140 search results - page 19 / 28 » Computing Minimum Spanning Trees with Uncertainty |
ICPR
2006
IEEE
16 years 23 days ago
2006
IEEE
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...
103
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
91
Voted
PPSN
2004
Springer
15 years 5 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
128
click to vote
ASIAMS
2007
IEEE
15 years 6 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
111
click to vote
ENDM
2010
14 years 11 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...