Sciweavers

598 search results - page 1 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
13 years 9 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
PARA
2004
Springer
13 years 10 months ago
Optimization of a Statically Partitioned Hypermatrix Sparse Cholesky Factorization
The sparse Cholesky factorization of some large matrices can require a two dimensional partitioning of the matrix. The sparse hypermatrix storage scheme produces a recursive 2D par...
José R. Herrero, Juan J. Navarro
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
13 years 2 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala
CISS
2011
IEEE
12 years 8 months ago
The Restricted Isometry Property for block diagonal matrices
—In compressive sensing (CS), the Restricted Isometry Property (RIP) is a powerful condition on measurement operators which ensures robust recovery of sparse vectors is possible ...
Han Lun Yap, Armin Eftekhari, Michael B. Wakin, Ch...
TIT
2010
174views Education» more  TIT 2010»
12 years 11 months ago
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
Jarvis Haupt, Waheed Uz Zaman Bajwa, Gil M. Raz, R...