Sciweavers

262 search results - page 32 / 53
» Image Registration with Minimum Spanning Tree Algorithm
Sort
View
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
15 years 3 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
77
Voted
ORL
2008
99views more  ORL 2008»
14 years 9 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...
MOBIHOC
2012
ACM
13 years 2 days ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn
CVPR
2007
IEEE
15 years 11 months ago
Gradient Intensity: A New Mutual Information-Based Registration Method
Conventional mutual information (MI)-based registration using pixel intensities is time-consuming and ignores spatial information, which can lead to misalignment. We propose a met...
Ramtin Shams, Parastoo Sadeghi, Rodney A. Kennedy
APPROX
2007
Springer
99views Algorithms» more  APPROX 2007»
15 years 3 months ago
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
Ilias Diakonikolas, Mihalis Yannakakis