5595 search results - page 321 / 1119 » Comparing Subsumption Optimizations |
173
click to vote
ESANN
2006
15 years 8 months ago
2006
We propose an efficient forward regression algorithm based on greedy optimization of marginal likelihood. It can be understood as a forward selection procedure which adds a new bas...
189
click to vote
ICMAS
2000
15 years 8 months ago
2000
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the...
159
click to vote
CHES
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, a thorough bottom-up optimization process (field, point and scalar arithmetic) is used to speed up the computation of elliptic curve point multiplication and report ...
168
click to vote
JNW
2006
15 years 6 months ago
2006
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...
199
click to vote
IJON
2007
15 years 6 months ago
2007
This paper addresses the problem of variable ranking for Support Vector Regression. The relevance criteria that we proposed are based on leave-one-out bounds and some variants and...