2252 search results - page 213 / 451 » Improving Random Forests |
170
click to vote
STACS
2005
Springer
16 years 17 hour ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
194
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
207
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
179
click to vote
CCS
2010
ACM
15 years 7 months ago
2010
ACM
Securing wireless sensor networks against node capture is a challenging task. All well-known random key pre-distribution systems, including the Eschenauer and Gligor's pionee...
158
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...