Sciweavers

26 search results - page 5 / 6
» Eigenvalues of Euclidean random matrices
Sort
View
NAA
2000
Springer
125views Mathematics» more  NAA 2000»
13 years 9 months ago
Matrix Computations Using Quasirandom Sequences
Abstract. The convergence of Monte Carlo method for numerical integration can often be improved by replacing pseudorandom numbers (PRNs) with more uniformly distributed numbers kno...
Michael Mascagni, Aneta Karaivanova
SDM
2012
SIAM
245views Data Mining» more  SDM 2012»
11 years 8 months ago
Deterministic CUR for Improved Large-Scale Data Analysis: An Empirical Study
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
Christian Thurau, Kristian Kersting, Christian Bau...
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 21 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
JCT
2000
111views more  JCT 2000»
13 years 5 months ago
Immanants and Finite Point Processes
Givena Hermitian,non-negativede nitekernelK and a character of the symmetric group on n letters, de ne the corresponding immanant function K x1;::: ;xn := P Qn i=1 Kxi;x i, where ...
Persi Diaconis, Steven N. Evans
SIAMREV
2010
174views more  SIAMREV 2010»
13 years 21 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