234 search results - page 13 / 47 » Rademacher Margin Complexity |
ACISP
2010
Springer
13 years 5 months ago
2010
Springer
Many applications using cryptographic hash functions do not require collision resistance, but some kind of preimage resistance. That's also the reason why the widely used SHA-...
WWW
2011
ACM
13 years 2 months ago
2011
ACM
There is a widespread intuitive sense that different kinds of information spread differently on-line, but it has been difficult to evaluate this question quantitatively since it ...
NAACL
2010
13 years 5 months ago
2010
We show how features can easily be added to standard generative models for unsupervised learning, without requiring complex new training methods. In particular, each component mul...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Maximum margin clustering (MMC) has recently attracted considerable interests in both the data mining and machine learning communities. It first projects data samples to a kernel...
NIPS
2008
13 years 8 months ago
2008
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...