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...
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...
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 ...
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...
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...