Sciweavers

2252 search results - page 174 / 451
» Improving Random Forests
Sort
View
ACL
1994
13 years 9 months ago
Optimizing the Computational Lexicalization of Large Grammars
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
Christian Jacquemin
CORR
2004
Springer
140views Education» more  CORR 2004»
13 years 8 months ago
Better algorithms for unfair metrical task systems and applications
Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems...
Amos Fiat, Manor Mendel
INFOCOM
2003
IEEE
14 years 1 months ago
Static and Dynamic Analysis of the Internet's Susceptibility to Faults and Attacks
— We analyze the susceptibility of the Internet to random faults, malicious attacks, and mixtures of faults and attacks. We analyze actual Internet data, as well as simulated dat...
Seung-Taek Park, Alexy Khrabrov, David M. Pennock,...
CLEF
2008
Springer
13 years 9 months ago
Diversity in Image Retrieval: DCU at ImageCLEFPhoto 2008
DCU participated in the ImageCLEF 2008 photo retrieval task, which aimed to evaluate diversity in Image Retrieval, submitting runs for both the English and Random language annotati...
Neil O'Hare, Peter Wilkins, Cathal Gurrin, Eamonn ...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 9 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs