1695 search results - page 40 / 339 » Linear, Polynomial or Exponential |
111
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
The AdaBoost algorithm was designed to combine many “weak” hypotheses that perform slightly better than random guessing into a “strong” hypothesis that has very low error....
78
Voted
JLP
2008
15 years 21 days ago
2008
A formulation of na
91
Voted
AMAI
2005
Springer
15 years 19 days ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
100
Voted
TOC
2008
15 years 19 days ago
2008
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
101
Voted
DM
2002
15 years 16 days ago
2002
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...