Sciweavers

411 search results - page 64 / 83
» Rank Estimation in Missing Data Matrix Problems
Sort
View
TSP
2008
123views more  TSP 2008»
13 years 9 months ago
MIMO Radar Space-Time Adaptive Processing Using Prolate Spheroidal Wave Functions
In the traditional transmitting beamforming radar system, the transmitting antennas send coherent waveforms which form a highly focused beam. In the multiple-input multipleoutput (...
Chun-Yang Chen, Palghat P. Vaidyanathan
ECML
2006
Springer
14 years 21 days ago
Efficient Prediction-Based Validation for Document Clustering
Recently, stability-based techniques have emerged as a very promising solution to the problem of cluster validation. An inherent drawback of these approaches is the computational c...
Derek Greene, Padraig Cunningham
JMLR
2002
89views more  JMLR 2002»
13 years 8 months ago
A Robust Minimax Approach to Classification
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...
Gert R. G. Lanckriet, Laurent El Ghaoui, Chiranjib...
ICASSP
2011
IEEE
13 years 22 days ago
Subspace constrained LU decomposition of FMLLR for rapid adaptation
This paper describes subspace constrained feature space maximum likelihood linear regression (FMLLR) for rapid adaptation. The test speaker’s FMLLR rotation matrix is decomposed...
Lei Jia, Dong Yu, Bo Xu
ECCV
2008
Springer
14 years 11 months ago
Quick Shift and Kernel Methods for Mode Seeking
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
Andrea Vedaldi, Stefano Soatto