Sciweavers

14165 search results - page 407 / 2833
» The generalized two-server problem
Sort
View
CORR
2011
Springer
202views Education» more  CORR 2011»
15 years 1 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
ICASSP
2011
IEEE
14 years 10 months ago
Multiantenna detection under noise uncertainty and primary user's spatial structure
Spectrum sensing is a challenging key component of the Cognitive Radio paradigm, since primary signals must be detected in the face of noise uncertainty and at signal-to-noise rat...
David Ramírez, Gonzalo Vazquez-Vilar, Rober...
ICASSP
2011
IEEE
14 years 10 months ago
Novel hierarchical ALS algorithm for nonnegative tensor factorization
The multiplicative algorithms are well-known for nonnegative matrix and tensor factorizations. The ALS algorithm for canonical decomposition (CP) has been proved as a “workhorse...
Anh Huy Phan, Andrzej Cichocki, Kiyotoshi Matsuoka...
GECCO
2011
Springer
261views Optimization» more  GECCO 2011»
14 years 10 months ago
Spacing memetic algorithms
We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space dista...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
215
Voted
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
14 years 10 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin