1055 search results - page 163 / 211 » order 2002 |
177
click to vote
LOGCOM
2002
15 years 5 months ago
2002
We present a logical approach to plan recognition that builds on Kautz's theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-level pl...
157
click to vote
MCS
2002
Springer
15 years 5 months ago
2002
Springer
In classifier combining, one tries to fuse the information that is given by a set of base classifiers. In such a process, one of the difficulties is how to deal with the variabilit...
156
click to vote
ML
2002
ACM
15 years 5 months ago
2002
ACM
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
140
click to vote
ML
2002
ACM
15 years 5 months ago
2002
ACM
The execution order of a block of computer instructions on a pipelined machine can make a difference in running time by a factor of two or more. Compilers use heuristic schedulers...
125
click to vote
MP
2002
15 years 5 months ago
2002
We revise the Volume Algorithm (VA) for linear programming and relate it to bundle methods. When first introduced, VA was presented as a subgradient-like method for solving the ori...