Sciweavers

85 search results - page 4 / 17
» A DC Programming Approach for Sparse Eigenvalue Problem
Sort
View
91
Voted
ICASSP
2011
IEEE
14 years 1 months ago
Sparse common spatial patterns in brain computer interface applications
The Common Spatial Pattern (CSP) method is a powerful technique for feature extraction from multichannel neural activity and widely used in brain computer interface (BCI) applicat...
Fikri Goksu, Nuri Firat Ince, Ahmed H. Tewfik
107
Voted
IPCO
2008
221views Optimization» more  IPCO 2008»
14 years 11 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
SIAMAM
2008
131views more  SIAMAM 2008»
14 years 9 months ago
Asymptotic and Numerical Techniques for Resonances of Thin Photonic Structures
We consider the problem of calculating resonance frequencies and radiative losses of an optical resonator. The optical resonator is in the form of a thin membrane with variable die...
J. Gopalakrishnan, S. Moskow, F. Santosa
MP
2007
75views more  MP 2007»
14 years 9 months ago
Solving maximum-entropy sampling problems using factored masks
We present a practical approach to Anstreicher and Lee’s masked spectral bound for maximum-entropy sampling, and we describe favorable results that we have obtained with a Branch...
Samuel Burer, Jon Lee
75
Voted
ICASSP
2010
IEEE
14 years 9 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...