2996 search results - page 469 / 600 » Numberings and Randomness |
193
click to vote
MCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract Investigating a data set of the critical size makes a classification task difficult. Studying dissimilarity data refers to such a problem, since the number of samples equa...
175
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
166
click to vote
ISTCS
1995
Springer
15 years 10 months ago
1995
Springer
We call a vector x 2 IRn highly regular if it satis es < x m >= 0 for some short, non{zero integer vector m where < : : > is the inner product. We present an algorithm...
166
click to vote
FSE
2010
Springer
15 years 9 months ago
2010
Springer
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
150
click to vote
ACMACE
2008
ACM
15 years 8 months ago
2008
ACM
The games with a purpose paradigm proposed by Luis von Ahn [9] is a new approach for game design where useful but boring tasks, like labeling a random image found in the web, are ...