Sciweavers

79 search results - page 12 / 16
» Fast Self-Stabilizing Minimum Spanning Tree Construction
Sort
View
EOR
2007
117views more  EOR 2007»
13 years 8 months ago
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
CVPR
2007
IEEE
14 years 10 months ago
Fiber Tract Clustering on Manifolds With Dual Rooted-Graphs
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
Andy Tsai, Carl-Fredrik Westin, Alfred O. Hero, Al...
JOIN
2007
91views more  JOIN 2007»
13 years 8 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
ICPR
2006
IEEE
14 years 9 months ago
Combinatorial Surface Integration
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...
Edwin R. Hancock, Roberto Fraile
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
14 years 2 months ago
: Standard Template Library for XXL Data Sets
Abstract. We present a software library Stxxl, that enables practiceoriented experimentation with huge data sets. Stxxl is an implementation of the C++ standard template library ST...
Roman Dementiev, Lutz Kettner, Peter Sanders