Sciweavers

2631 search results - page 1 / 527
» A Practical Method for the Sparse Resultant
Sort
View
ISSAC
1993
Springer
101views Mathematics» more  ISSAC 1993»
13 years 9 months ago
A Practical Method for the Sparse Resultant
Ioannis Z. Emiris, John F. Canny
PARA
2004
Springer
13 years 10 months ago
Parallel Hybrid Sparse Solvers Through Flexible Incomplete Cholesky Preconditioning
Abstract. We consider parallel preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) for sparse linear system solution. We develop methods for construct...
Keita Teranishi, Padma Raghavan
CW
2002
IEEE
13 years 10 months ago
Efficient Data Compression Methods for Multi-Dimensional Sparse Array Operations
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...
Chun-Yuan Lin, Yeh-Ching Chung, Jen-Shiuh Liu
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
13 years 10 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 5 months ago
Compressed Sensing for Sparse Underwater Channel Estimation: Some Practical Considerations
We examine the use of a structured thresholding algorithm for sparse underwater channel estimation using compressed sensing. This method shows some improvements over standard algo...
Sushil Subramanian