Sciweavers

262 search results - page 30 / 53
» Image Registration with Minimum Spanning Tree Algorithm
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 3 months ago
Evolutionary algorithms and matroid optimization problems
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
Joachim Reichel, Martin Skutella
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 1 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
STACS
2001
Springer
15 years 2 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
TCAD
2008
119views more  TCAD 2008»
14 years 9 months ago
FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
Chris C. N. Chu, Yiu-Chung Wong
CVPR
2010
IEEE
14 years 9 months ago
Delineating trees in noisy 2D images and 3D image-stacks
We present a novel approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local evidence, ou...
Germán González, Engin Türetken...