1092 search results - page 155 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
163
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
155
click to vote
ISSAC
2007
Springer
16 years 13 days ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
159
click to vote
EUROCRYPT
2005
Springer
15 years 11 months ago
2005
Springer
The Lenstra-Lenstra-Lov´asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensi...
177
click to vote
ECCC
2010
15 years 4 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
189
click to vote
JAIR
2010
15 years 4 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...