262 search results - page 18 / 53 » Image Registration with Minimum Spanning Tree Algorithm |
OPODIS
2004
14 years 11 months ago
2004
Abstract. Ad-hoc networks do not provide an infrastructure for communication such as routers and are characterized by 1) quick changes of communication topology and 2) unstable sys...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
WAOA
2007
Springer
15 years 3 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
114
click to vote
ISDA
2008
IEEE
15 years 4 months ago
2008
IEEE
In image guided surgery, the registration of preand intra-operative image data is an important issue. In registrations, we seek an estimate of the transformation that registers th...
80
Voted
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...