1362 search results - page 103 / 273 » Means, Correlations and Bounds |
120
click to vote
JOCN
2010
15 years 3 days ago
2010
■ We employ a single-trial correlational MEG analysis technique to investigate early processing in the visual recognition of morphologically complex words. Three classes of affi...
116
click to vote
COLT
2010
Springer
14 years 11 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
137
click to vote
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
118
click to vote
COLT
2005
Springer
15 years 7 months ago
2005
Springer
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...
QUESTA
2010
15 years 2 days ago
2010
The M/G/K queueing system is one of the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coar...