4342 search results - page 465 / 869 » Improved Algorithms for Optimal Embeddings |
177
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation...
226
click to vote
UAI
2008
15 years 8 months ago
2008
In this paper we introduce Refractor Importance Sampling (RIS), an improvement to reduce error variance in Bayesian network importance sampling propagation under evidential reason...
213
click to vote
AUSSOIS
2001
Springer
15 years 11 months ago
2001
Springer
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...
174
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
We describe an adaptation of the billiard algorithm for finding dense packings of equal spheres inside a domain of the euclidean space. In order to improve the convergence of this...
197
click to vote
ICMLA
2009
15 years 4 months ago
2009
This article proposes an algorithm to automatically learn useful transformations of data to improve accuracy in supervised classification tasks. These transformations take the for...