1450 search results - page 146 / 290 » On the Complexity of Hardness Amplification |
ICML
1999
IEEE
14 years 10 months ago
1999
IEEE
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
ICSE
2009
IEEE-ACM
14 years 10 months ago
2009
IEEE-ACM
Parallelizing existing sequential programs to run efficiently on multicores is hard. The Java 5 package java.util.concurrent (j.u.c.) supports writing concurrent programs: much of...
CADE
2005
Springer
14 years 9 months ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
OSDI
2008
ACM
14 years 9 months ago
2008
ACM
Because writing computer programs is hard, computer programmers are taught to use encapsulation and modularity to hide complexity and reduce the potential for errors. Their progra...
SIGMOD
2007
ACM
14 years 9 months ago
2007
ACM
Good cardinality estimates are critical for generating good execution plans during query optimization. Complex predicates, correlations between columns, and user-defined functions...