688 search results - page 14 / 138 » Computing with subspaces |
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
We study the use of kernel subspace methods that learn low-dimensional subspace representations for classification tasks. In particular, we propose a new method called kernel weigh...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
COCO
2004
Springer
14 years 24 days ago
2004
Springer
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...