Sciweavers

327 search results - page 42 / 66
» Some Elimination Problems for Matrices
Sort
View
ICML
2008
IEEE
14 years 10 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
EUROCAST
2003
Springer
134views Hardware» more  EUROCAST 2003»
14 years 3 months ago
Volumetric Texture Description and Discriminant Feature Selection for MRI
This paper considers the problem of texture description and feature selection for the classification of tissues in 3D Magnetic Resonance data. Joint statistical measures like grey...
Abhir Bhalerao, Constantino Carlos Reyes-Aldasoro
SIAMAM
2011
13 years 4 months ago
Imaging Schemes for Perfectly Conducting Cracks
We consider the problem of locating perfectly conducting cracks and estimating their geometric features from multi-static response matrix measurements at a single or multiple frequ...
Habib Ammari, Josselin Garnier, Hyeonbae Kang, Won...
JACM
2011
152views more  JACM 2011»
13 years 24 days ago
Robust principal component analysis?
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
Emmanuel J. Candès, Xiaodong Li, Yi Ma, Joh...
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
12 years 10 days ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko