492 search results - page 72 / 99 » The number of possibilities for random dating |
CORR
2011
Springer
13 years 15 days ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
PODC
2011
ACM
12 years 11 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
IVC
2008
13 years 8 months ago
2008
Reversible jump Markov chain Monte Carlo (RJMCMC) is a recent method which makes it possible to construct reversible Markov chain samplers that jump between parameter subspaces of...
AAAI
2011
12 years 8 months ago
2011
In many real world applications, the number of examples to learn from is plentiful, but we can only obtain limited information on each individual example. We study the possibiliti...
IACR
2011
12 years 8 months ago
2011
Unlike the standard notion of pseudorandom functions (PRF), a non-adaptive PRF is only required to be indistinguishable from random in the eyes of a non-adaptive distinguisher (i....