711 search results - page 100 / 143 » An Empirical Comparison of Selection Methods in Evolutionary... |
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
We consider the problem of fitting a large-scale covariance matrix to multivariate Gaussian data in such a way that the inverse is sparse, thus providing model selection. Beginnin...
ICANN
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
Image segmentation is a fundamental step in many computer vision applications. Generally, the choice of a segmentation algorithm, or parameterization of a given algorithm, is sele...