Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Background: Computational analysis of metagenomes requires the taxonomical assignment of the genome contigs assembled from DNA reads of environmental samples. Because of the diver...
Ozkan U. Nalbantoglu, Samuel F. Way, Steven H. Hin...
Abstract—Many practical applications require the reconstruction of images from irregularly sampled data. The spline formalism offers an attractive framework for solving this prob...
Oleksii Vyacheslav Morozov, Michael Unser, Patrick...
Abstract--Most existing works on routing for video transmission over multihop wireless networks only focus on how to satisfy the network-oriented quality-of-service (QoS), such as ...
Dalei Wu, Song Ci, Haohong Wang, Aggelos K. Katsag...
In this paper we address the problem of estimating and analyzing the motion in image sequences that involve fluid phenomena. In this context standard motion estimation techniques ...