Sciweavers

412 search results - page 76 / 83
» Diagonalization
Sort
View
FOCS
2005
IEEE
15 years 11 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...
ICA
2004
Springer
15 years 11 months ago
Postnonlinear Overcomplete Blind Source Separation Using Sparse Sources
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
Fabian J. Theis, Shun-ichi Amari
ICA
2004
Springer
15 years 11 months ago
Second-Order Blind Source Separation Based on Multi-dimensional Autocovariances
SOBI is a blind source separation algorithm based on time decorrelation. It uses multiple time autocovariance matrices, and performs joint diagonalization thus being more robust th...
Fabian J. Theis, Anke Meyer-Bäse, Elmar Wolfg...
GECCO
2003
Springer
107views Optimization» more  GECCO 2003»
15 years 11 months ago
Exploration of a Two Sided Rendezvous Search Problem Using Genetic Algorithms
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
T. Q. S. Truong, A. Stacey
WADS
2001
Springer
63views Algorithms» more  WADS 2001»
15 years 10 months ago
When Can You Fold a Map?
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequenc...
Esther M. Arkin, Michael A. Bender, Erik D. Demain...