2492 search results - page 284 / 499 » On the General Signature Trees |
156
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
: - In the first part of this paper we present the first steps towards providing low-risk and economically feasible network data transfer services. We introduce three types of data...
170
click to vote
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...
155
Voted
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...
147
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...
159
click to vote
PR
2010
15 years 4 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 ...