2252 search results - page 255 / 451 » Improving Random Forests |
98
Voted
ALDT
2009
Springer
15 years 5 months ago
2009
Springer
We study the problem of allocating a set of indivisible items to players having additive utility functions over the items. We consider allocations in which no player envies the bun...
105
click to vote
ASPDAC
2007
ACM
15 years 5 months ago
2007
ACM
With the emerging process variations in fabrication, the traditional corner-based timing optimization techniques become prohibitive. Buffer insertion is a very useful technique fo...
119
Voted
GBRPR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
121
Voted
ICANN
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
117
Voted
ECRTS
2004
IEEE
15 years 4 months ago
2004
IEEE
The contribution of this paper is threefold. First, an improvement to a previously published paper on the timing analysis of Controller Area Network (CAN) in the presence of trans...