Sciweavers

301 search results - page 46 / 61
» Learning to Select a Good Translation
Sort
View
CIKM
2000
Springer
14 years 2 months ago
Boosting for Document Routing
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
Raj D. Iyer, David D. Lewis, Robert E. Schapire, Y...
ML
2006
ACM
13 years 9 months ago
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
ICTAI
2007
IEEE
14 years 4 months ago
On Portfolios for Backtracking Search in the Presence of Deadlines
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
Huayue Wu, Peter van Beek
NIPS
2007
13 years 11 months ago
Predictive Matrix-Variate t Models
It is becoming increasingly important to learn from a partially-observed random matrix and predict its missing elements. We assume that the entire matrix is a single sample drawn ...
Shenghuo Zhu, Kai Yu, Yihong Gong
FGCS
2000
104views more  FGCS 2000»
13 years 9 months ago
Protecting secret keys with personal entropy
Conventional encryption technology often requires users to protect a secret key by selecting a password or passphrase. While a good passphrase will only be known to the user, it a...
Carl M. Ellison, Chris Hall, Randy Milbert, Bruce ...