171 search results - page 9 / 35 » Maximally fast and arbitrarily fast implementation of linear... |
TSP
2008
13 years 7 months ago
2008
This paper presents a new implementation of the YAST algorithm for principal and minor subspace tracking. YAST was initially derived from the Subspace Projection (SP) algorithm by ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this work a new adaptive fast variational sparse Bayesian learning (V-SBL) algorithm is proposed that is a variational counterpart of the fast marginal likelihood maximization ...
ICML
2009
IEEE
14 years 2 months ago
2009
IEEE
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...
ICCS
2004
Springer
14 years 1 months ago
2004
Springer
The paper presents a highly optimized implementation of a multifrontal solver for linear systems arising in the FEM simulation of multi-physics problems related to the behaviour of...
DATAMINE
1999
13 years 7 months ago
1999
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...