Sciweavers

154 search results - page 8 / 31
» Optimization problems in multiple subtree graphs
Sort
View
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 1 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
ICRA
2000
IEEE
88views Robotics» more  ICRA 2000»
15 years 1 months ago
Incremental Optimization of Cyclic Timed Event Graphs
In this paper we deal with the problem of allocating a given number of tokens, so as to maximize the firing rate of a cyclic event graph with deterministic transition firing delay...
Alessandro Giua, Aldo Piccaluga, Carla Seatzu
IPL
2008
146views more  IPL 2008»
14 years 9 months ago
A running time analysis of an Ant Colony Optimization algorithm for shortest paths in directed acyclic graphs
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
Nattapat Attiratanasunthron, Jittat Fakcharoenphol
PAMI
2006
181views more  PAMI 2006»
14 years 9 months ago
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka
211
Voted
IPMI
2011
Springer
14 years 25 days ago
Surface-Region Context in Optimal Multi-object Graph-Based Segmentation: Robust Delineation of Pulmonary Tumors
Abstract. Multi-object segmentation with mutual interaction is a challenging task in medical image analysis. We report a novel solution to a segmentation problem, in which target o...
Qi Song, Mingqing Chen, Junjie Bai, Milan Sonka, X...