Sciweavers

396 search results - page 22 / 80
» An Optimal Minimum Spanning Tree Algorithm
Sort
View
MICCAI
2005
Springer
16 years 8 months ago
Automatic Vascular Tree Formation Using the Mahalanobis Distance
We present a novel technique for the automatic formation of vascular trees from segmented tubular structures. Our method combines a minimum spanning tree algorithm with a minimizat...
Julien Jomier, Vincent LeDigarcher, Stephen R. Ayl...
ACID
2006
298views Algorithms» more  ACID 2006»
15 years 8 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
JOIN
2007
91views more  JOIN 2007»
15 years 7 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
IPL
1998
119views more  IPL 1998»
15 years 7 months ago
A 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Sunil Arya, H. Ramesh
214
Voted
NI
2011
168views more  NI 2011»
14 years 10 months ago
Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors
We present a novel probabilistic approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local...
Engin Türetken, Germán González...