Sciweavers

511 search results - page 61 / 103
» Lower bounds for distributed markov chain problems
Sort
View
CORR
2010
Springer
49views Education» more  CORR 2010»
13 years 8 months ago
Distributed Algorithms for Learning and Cognitive Medium Access with Logarithmic Regret
The problem of distributed learning and channel access is considered in a cognitive network with multiple secondary users. The availability statistics of the channels are initially...
Animashree Anandkumar, Nithin Michael, Ao Kevin Ta...
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 7 months ago
Asymptotically Optimal Multiple-access Communication via Distributed Rate Splitting
We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a ...
Jian Cao, Edmund M. Yeh
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 8 months ago
Local algorithms in (weakly) coloured graphs
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
Matti Åstrand, Valentin Polishchuk, Joel Ryb...
FGR
2008
IEEE
221views Biometrics» more  FGR 2008»
14 years 2 months ago
Markovian mixture face recognition with discriminative face alignment
A typical automatic face recognition system is composed of three parts: face detection, face alignment and face recognition. Conventionally, these three parts are processed in a b...
Ming Zhao 0003, Tat-Seng Chua
FOCS
2008
IEEE
14 years 2 months ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly