2735 search results - page 357 / 547 » Comparing notions of randomness |
137
Voted
FOCS
2010
IEEE
14 years 11 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
143
Voted
SCN
2010
Springer
14 years 11 months ago
2010
Springer
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
135
click to vote
JMLR
2011
14 years 8 months ago
2011
While most supervised machine learning models assume that training examples are sampled at random or adversarially, this article is concerned with models of learning from a cooper...
152
Voted
SIAMJO
2011
14 years 3 months ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
131
click to vote
SIGECOM
2011
ACM
14 years 3 months ago
2011
ACM
Suppose a principal Alice wishes to reduce her uncertainty regarding some future payoff. Consider a self-proclaimed expert Bob that may either be an informed expert knowing an ex...