A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
In this paper we present a novel approach for estimating featurespace maximum likelihood linear regression (fMLLR) transforms for full-covariance Gaussian models by directly maxim...
Arnab Ghoshal, Daniel Povey, Mohit Agarwal, Pinar ...
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
Abstract. This paper proposes a new method to compute connectivity information from diffusion weighted images. It is inspired by graphbased approaches to connectivity definition,...
Marc Niethammer, Alexis Boucharin, Christopher Zac...
Packet-switching WDM ring networks with a hotspot transporting unicast, multicast, and broadcast trac are important components of high-speed metropolitan area networks. For an arbi...
Matthias an der Heiden, Michel Sortais, Michael Sc...