Sciweavers

262 search results - page 19 / 53
» Image Registration with Minimum Spanning Tree Algorithm
Sort
View
INFOCOM
1992
IEEE
15 years 1 months ago
Topological Design of Interconnected LAN-MAN Networks
This paper describes a methodology for designing interconnected LAN-MAN networks with the objective of minimizing the average network delay. We consider IEEE 802.3-5 LANs intercon...
Cem Ersoy, Shivendra S. Panwar
ASPDAC
2005
ACM
158views Hardware» more  ASPDAC 2005»
14 years 11 months ago
The polygonal contraction heuristic for rectilinear Steiner tree construction
— Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We transform a rectilinear minimum spanning tree (...
Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xia...
86
Voted
CPC
2007
97views more  CPC 2007»
14 years 9 months ago
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
Jan Remy, Alexander Souza, Angelika Steger
GBRPR
2007
Springer
15 years 3 months ago
Matching of Tree Structures for Registration of Medical Images
Many medical applications require a registration of different images of the same organ. In many cases, such a registration is accomplished by manually placing landmarks in the ima...
Jan Hendrik Metzen, Tim Kröger, Andrea Schenk...
AINA
2007
IEEE
15 years 4 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein