3455 search results - page 433 / 691 » Generalized Game Trees |
174
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
: Boosting is a general method for improving the accuracy of any given learning algorithm. In this paper we employ combination of Adaboost with Support Vector Machine (SVM) as comp...
172
click to vote
COR
2006
15 years 6 months ago
2006
There is an age old debate in curling about whether it is better to be down one point with last shot, or ahead by one point without. The objective of this paper is to apply sensit...
159
click to vote
IS
2006
15 years 6 months ago
2006
Views stored in a data warehouse need to be kept current. As recomputing the views is very expensive, incremental maintenance algorithms are required. Over recent years, several i...
168
click to vote
PR
2010
15 years 5 months ago
2010
The performance of m-out-of-n bagging with and without replacement in terms of the sampling ratio (m/n) is analyzed. Standard bagging uses resampling with replacement to generate ...
266
click to vote
EJC
2011
14 years 10 months ago
2011
We provide a new proof of Brylawski’s formula for the Tutte polynomial of the tensor product of two matroids. Our proof involves extending Tutte’s formula, expressing the Tutte...