Sciweavers

226 search results - page 27 / 46
» Parallel mixing
Sort
View
STACS
1999
Springer
14 years 5 days ago
Worst-case Equilibria
We investigate the problem of routing traffic through a congested network in an environment of non-cooperative users. We use the worst-case coordination ratio suggested by Koutsou...
Elias Koutsoupias, Christos H. Papadimitriou
NETWORKS
2008
13 years 7 months ago
Reformulation and sampling to solve a stochastic network interdiction problem
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
Udom Janjarassuk, Jeff Linderoth
TASLP
2010
148views more  TASLP 2010»
13 years 2 months ago
Batch and Adaptive PARAFAC-Based Blind Separation of Convolutive Speech Mixtures
We present a frequency-domain technique based on PARAllel FACtor (PARAFAC) analysis that performs multichannel blind source separation (BSS) of convolutive speech mixtures. PARAFAC...
Dimitri Nion, Kleanthis N. Mokios, Nicholas D. Sid...
PR
2011
12 years 10 months ago
Generalized darting Monte Carlo
One of the main shortcomings of Markov chain Monte Carlo samplers is their inability to mix between modes of the target distribution. In this paper we show that advance knowledge ...
Cristian Sminchisescu, Max Welling
IPPS
2006
IEEE
14 years 1 months ago
Coterminous locality and coterminous group data prefetching on chip-multiprocessors
Due to shared cache contentions and interconnect delays, data prefetching is more critical in alleviating penalties from increasing memory latencies and demands on Chip-Multiproce...
Xudong Shi, Zhen Yang, Jih-Kwon Peir, Lu Peng, Yen...