Sciweavers

1229 search results - page 135 / 246
» On the gaussian distribution of strings
Sort
View
NIPS
2003
15 years 7 months ago
Learning the k in k-means
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...
Greg Hamerly, Charles Elkan
CORR
2010
Springer
124views Education» more  CORR 2010»
15 years 6 months ago
Online Learning of Noisy Data with Kernels
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
CORR
2008
Springer
119views Education» more  CORR 2008»
15 years 6 months ago
BER and Outage Probability Approximations for LMMSE Detectors on Correlated MIMO Channels
This paper is devoted to the study of the performance of the linear minimum mean-square error (LMMSE) receiver for (receive) correlated multiple-input multiple-output (MIMO) system...
Abla Kammoun, Malika Kharouf, Walid Hachem, Jamal ...
CORR
2007
Springer
128views Education» more  CORR 2007»
15 years 6 months ago
Model Selection Through Sparse Maximum Likelihood Estimation
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...
NA
2008
78views more  NA 2008»
15 years 6 months ago
A walk through energy, discrepancy, numerical integration and group invariant measures on measurable subsets of euclidean space
(A) The celebrated Gaussian quadrature formula on finite intervals tells us that the Gauss nodes are the zeros of the unique solution of an extremal problem. We announce recent re...
S. B. Damelin