12 search results - page 3 / 3 » Complexity bounds of radial basis functions and multi-object... |
CGO
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper proposes the use of empirical modeling techniques for building microarchitecture sensitive models for compiler optimizations. The models we build relate program perform...
PKDD
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...