Sciweavers

7106 search results - page 759 / 1422
» Restricted Complexity, General Complexity
Sort
View
DM
1998
57views more  DM 1998»
15 years 7 months ago
Note on alternating directed cycles
The problem of the existence of an alternating simple dicycle in a 2-arc-coloured digraph is considered. This is a generalization of the alternating cycle problem in 2-edgecoloure...
Gregory Gutin, Benny Sudakov, Anders Yeo
JMLR
2002
89views more  JMLR 2002»
15 years 7 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor
ML
2002
ACM
145views Machine Learning» more  ML 2002»
15 years 7 months ago
Boosting Methods for Regression
In this paper we examine ensemble methods for regression that leverage or "boost" base regressors by iteratively calling them on modified samples. The most successful lev...
Nigel Duffy, David P. Helmbold
MT
1998
91views more  MT 1998»
15 years 7 months ago
A Controlled Skip Parser
Real-world natural language sentences are long and complex, and always contain unexpected grammatical constructions. It even includes noise and ungrammaticality. This paper descri...
Kenji Yamada
PAMI
1998
127views more  PAMI 1998»
15 years 7 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho