775 search results - page 90 / 155 » Cone-restricted subspace methods |
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
PAKDD
2009
ACM
15 years 4 months ago
2009
ACM
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...
CRV
2008
IEEE
15 years 4 months ago
2008
IEEE
We propose a generative statistical approach to human motion modeling and tracking that utilizes probabilistic latent semantic (PLSA) models to describe the mapping of image featu...
IJCNN
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
110
click to vote
ECML
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Principal component analysis (PCA) is a well-known classical data analysis technique. There are a number of algorithms for solving the problem, some scaling better than o...