Sciweavers

313 search results - page 11 / 63
» Solving Structured Polynomial Systems and Applications to Cr...
Sort
View
FOCS
2002
IEEE
14 years 1 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
QEST
2006
IEEE
14 years 2 months ago
Exploring correctness and accuracy of solutions to matrix polynomial equations in queues
Spectral expansion and matrix analytic methods are important solution mechanisms for matrix polynomial equations. These equations are encountered in the steady-state analysis of M...
David Thornley, Harf Zatschler
FC
2007
Springer
105views Cryptology» more  FC 2007»
14 years 17 days ago
Space-Efficient Private Search with Applications to Rateless Codes
Abstract. Private keyword search is a technique that allows for searching and retrieving documents matching certain keywords without revealing the search criteria. We improve the s...
George Danezis, Claudia Díaz
AAAI
1990
13 years 9 months ago
Tree Decomposition with Applications to Constraint Processing
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
Itay Meiri, Judea Pearl, Rina Dechter
GLVLSI
2008
IEEE
129views VLSI» more  GLVLSI 2008»
14 years 3 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....