Sciweavers

400 search results - page 80 / 80
» Subspace evasive sets
Sort
View
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 1 days ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
SIAMREV
2010
174views more  SIAMREV 2010»
13 years 1 days ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo
CEC
2011
IEEE
12 years 5 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
CVPR
2012
IEEE
11 years 10 months ago
Foreground Detection Using Spatiotemporal Projection Kernels
Foreground detection is at the core of many video processing tasks. In this paper, we propose a novel video foreground detection method that exploits the statistics of 3D space-tim...
Y. Moshe, H. Hel-Or, and Y. Hel-Or
SIAMMA
2011
97views more  SIAMMA 2011»
12 years 8 months ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...