417 search results - page 35 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
ILP
2003
Springer
14 years 1 months ago
2003
Springer
In many data mining tools that support regression tasks, training data are stored in a single table containing both the target field (dependent variable) and the attributes (indepe...
CLEF
2009
Springer
13 years 9 months ago
2009
Springer
In this paper we will briefly describe the approaches taken by the Berkeley Cheshire Group for the GikiCLEF task of the QA track. Because the task was intended to model some aspec...
TPDS
1998
13 years 8 months ago
1998
—A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found ...