2040 search results - page 253 / 408 » On the Complexity of Error Explanation |
156
click to vote
LREC
2010
15 years 7 months ago
2010
Today's natural language processing systems are growing more complex with the need to incorporate a wider range of language resources and more sophisticated statistical metho...
171
Voted
HIS
2004
15 years 7 months ago
2004
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
186
click to vote
WSCG
2003
15 years 7 months ago
2003
We present a refinement and a coarsening (also simplification or decimation) algorithm for the adaptive representation of bivariate functions. The algorithms have proved to be eff...
123
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
Although the linear mean-squared error (MSE) complex-DFT estimator, i.e., the Wiener filter, is well-known, its magnitude-DFT (MDFT) counterpart has never been considered in the ...
186
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...