Sciweavers

207 search results - page 9 / 42
» The Polynomial Method for Random Matrices
Sort
View
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
14 years 2 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
12 years 8 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
14 years 5 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
GLVLSI
2008
IEEE
129views VLSI» more  GLVLSI 2008»
14 years 2 months ago
Variational capacitance modeling using orthogonal polynomial method
In this paper, we propose a novel statistical capacitance extraction method for interconnects considering process variations. The new method, called statCap, is based on the spect...
Jian Cui, Gengsheng Chen, Ruijing Shen, Sheldon X....
CORR
2010
Springer
145views Education» more  CORR 2010»
13 years 5 months ago
Orthogonal symmetric Toeplitz matrices for compressed sensing: Statistical isometry property
Recently, the statistical restricted isometry property (RIP) has been formulated to analyze the performance of deterministic sampling matrices for compressed sensing. In this paper...
Kezhi Li, Lu Gan, Cong Ling