299 search results - page 22 / 60 » Optimizing Polynomial Solvers for Minimal Geometry Problems |
KDD
2010
ACM
13 years 9 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
JACM
2008
13 years 7 months ago
2008
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
CCE
2011
13 years 2 months ago
2011
This contribution deals with the optimization of the design of reactive distillation columns by using a memetic algorithm (MA) which is a combination of an evolution strategy (ES)...
PROCEDIA
2010
13 years 6 months ago
2010
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...