1648 search results - page 142 / 330 » Where to Build a Door |
156
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
190
click to vote
ALT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present a survey of recent results concerning the theoretical and empirical performance of algorithms for learning regularized least-squares classifiers. The behavior ...
244
click to vote
BMCBI
2007
15 years 6 months ago
2007
Variable importance measures for random forests have been receiving increased attention as a means of variable selection in many classification tasks in bioinformatics and relate...
190
click to vote
SCN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. A hidden vector encryption scheme (HVE) is a derivation of identity-based encryption, where the public key is actually a vector over a certain alphabet. The decryption ke...
218
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Learning theory has largely focused on two main learning scenarios. The first is the classical statistical setting where instances are drawn i.i.d. from a fixed distribution and...