Sciweavers

10054 search results - page 293 / 2011
» On the Complexity of Function Learning
Sort
View
112
Voted
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 3 months ago
Multiparty Communication Complexity of Disjointness
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
Arkadev Chattopadhyay, Anil Ada
153
Voted
CDC
2009
IEEE
139views Control Systems» more  CDC 2009»
15 years 1 months ago
Synchronization stability of complex dynamical networks with probabilistic time-varying delays
Abstract-- A kind of complex dynamical networks with timevarying coupling delays is proposed. By some transformation, the synchronization problem of the complex networks is transfe...
Hongjie Li, Dong Yue, Zhou Gu
122
Voted
TSP
2010
14 years 10 months ago
On entropy rate for the complex domain and its application to i.i.d. sampling
We derive the entropy rate formula for a complex Gaussian random process by using a widely linear model. The resulting expression is general and applicable to both circular and non...
Wei Xiong, Hualiang Li, Tülay Adali, Yi-Ou Li...
TSP
2010
14 years 10 months ago
A complex generalized Gaussian distribution: characterization, generation, and estimation
The generalized Gaussian distribution (GGD) provides a flexible and suitable tool for data modeling and simulation, however the characterization of the complex-valued GGD, in parti...
Mike Novey, Tülay Adali, Anindya Roy
109
Voted
AAAI
2008
15 years 6 months ago
Fast Spectral Learning using Lanczos Eigenspace Projections
The core computational step in spectral learning
Sridhar Mahadevan