774 search results - page 53 / 155 » A subdivision-based algorithm for the sparse resultant |
113
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
119
click to vote
ICML
2008
IEEE
16 years 2 months ago
2008
IEEE
Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of th...
110
click to vote
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...
142
click to vote
EUROPAR
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...
137
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...