Sciweavers

262 search results - page 25 / 53
» Image Registration with Minimum Spanning Tree Algorithm
Sort
View
ESA
1994
Springer
138views Algorithms» more  ESA 1994»
15 years 1 months ago
Efficient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
Sunil Arya, Michiel H. M. Smid
IJCM
2002
92views more  IJCM 2002»
14 years 9 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
GAMESEC
2010
139views Game Theory» more  GAMESEC 2010»
14 years 7 months ago
Design of Network Topology in an Adversarial Environment
We study the strategic interaction between a network manager whose goal is to choose (as communication infrastructure) a spanning tree of a network given as an undirected graph, an...
Assane Gueye, Jean C. Walrand, Venkat Anantharam
73
Voted
ICPR
2006
IEEE
15 years 10 months ago
Multimodal Registration using the Discrete Wavelet Frame Transform
Image registration is a critical step in medical image analysis. In this paper, a novel image registration method based on the discrete wavelet frame transform (DWFT) and the sum ...
Shutao Li, Jinglin Peng, James T. Kwok, Jing Zhang
SAC
2009
ACM
15 years 2 months ago
Autonomous networked robots for the establishment of wireless communication in uncertain emergency response scenarios
During a disaster, emergency response operations can benefit from the establishment of a wireless ad hoc network. We propose the use of autonomous robots that move inside a disas...
Stelios Timotheou, Georgios Loukas