Sciweavers

178 search results - page 15 / 36
» Martin's maximum revisited
Sort
View
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
15 years 1 months ago
Capacitated Confluent Flows: Complexity and Algorithms
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...
Daniel Dressler and Martin Strehler
ICASSP
2010
IEEE
14 years 9 months ago
A novel estimation of feature-space MLLR for full-covariance models
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 ...
TKDE
2008
121views more  TKDE 2008»
14 years 9 months ago
On Modularity Clustering
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...
MIAR
2010
IEEE
14 years 8 months ago
DTI Connectivity by Segmentation
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...
CORR
2008
Springer
130views Education» more  CORR 2008»
14 years 9 months ago
Multicast Capacity of Optical WDM Packet Ring for Hotspot Traffic
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...