Next generation networks are required to provide bandwidth on-demand for fine granularity sessions. In this sense, centralized CAC (Connection Admission Control) approaches could ...
We show that for every connected graph G of diameter 3, the graph G3 has average degree 7 4 (G). We also provide an example showing that this bound is best possible. This resolv...
This paper presents the binary flattenings of shapes, first as a connected operator suppressing particles or holes, second as an erosion in a particular lattice of shapes. Using t...
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
Abstract. We propose a novel probabilistic framework to merge information from DWI tractography and resting-state fMRI correlations. In particular, we model the interaction of late...
Archana Venkataraman, Yogesh Rathi, Marek Kubicki,...