The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
This paper introduces the Interlevel Product (ILP) which is a transform based upon the Dual-Tree Complex Wavelet. Coefficients of the ILP have complex values whose magnitudes indi...
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
Imen Boukhris, Zied Elouedi, Thomas Fober, Marco M...
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...