Sciweavers

2563 search results - page 243 / 513
» Parallel matrix algorithms and applications
Sort
View
ICML
2008
IEEE
16 years 5 months ago
Training SVM with indefinite kernels
Similarity matrices generated from many applications may not be positive semidefinite, and hence can't fit into the kernel machine framework. In this paper, we study the prob...
Jianhui Chen, Jieping Ye
GLOBECOM
2009
IEEE
15 years 11 months ago
Interference Subspace Tracking for Network Interference Alignment in Cellular Systems
— In this paper, a practical solution to implement the distributed interference alignment (IA) algorithm of [1] in a cellular communication system is proposed. In the training pe...
Bo Niu, Alexander M. Haimovich
VLDB
1997
ACM
141views Database» more  VLDB 1997»
15 years 8 months ago
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...
Thomas Seidl, Hans-Peter Kriegel
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
15 years 4 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
ICIP
2009
IEEE
15 years 2 months ago
Fast subspace-based tensor data filtering
Subspace-based methods rely on dominant element selection from second order statistics. They have been extended to tensor processing, in particular to tensor data filtering. For t...
Julien Marot, Caroline Fossati, Salah Bourennane