1728 search results - page 103 / 346 » The Accelerated Euclidean Algorithm |
134
Voted
JMLR
2006
2006
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
15 years 2 months ago
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
111
click to vote
IJON
2002
15 years 2 months ago
2002
We study the relation between maps of a high-dimensional stimulus manifold onto an essentially two-dimensional cortical area and low-dimensional maps of stimulus features such as ...
115
click to vote
DCG
1998
15 years 2 months ago
1998
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
101
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
This paper proposes a new distance metric between clusterings that incorporates information about the spatial distribution of points and clusters. Our approach builds on the idea ...
138
click to vote
CORR
2012
Springer
13 years 10 months ago
2012
Springer
Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and...