Results 1  10
of
14,775
Algebraic Methods for Interactive Proof Systems
, 1990
"... We present a new algebraic technique for the construction of interactive proof systems. We use our technique to prove that every language in the polynomialtime hierarchy has an interactive proof system. This technique played a pivotal role in the recent proofs that IP=PSPACE (Shamir) and that MIP ..."
Abstract

Cited by 338 (28 self)
 Add to MetaCart
We present a new algebraic technique for the construction of interactive proof systems. We use our technique to prove that every language in the polynomialtime hierarchy has an interactive proof system. This technique played a pivotal role in the recent proofs that IP=PSPACE (Shamir
Algebraic methods in the theory of lower bounds for boolean circuit complexity
 IN PROCEEDINGS OF THE 19TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC ’87
, 1987
"... We use algebraic methods to get lower bounds for complexity of different functions based on constant depth unbounded fanin circuits with the given set of basic operations. In particular, we prove that depth k circuits with gates NOT, OR and MOD, where p is a prime require Ezp(O(n’)) gates to calcu ..."
Abstract

Cited by 329 (1 self)
 Add to MetaCart
We use algebraic methods to get lower bounds for complexity of different functions based on constant depth unbounded fanin circuits with the given set of basic operations. In particular, we prove that depth k circuits with gates NOT, OR and MOD, where p is a prime require Ezp(O(n’)) gates
Algebraic Method
, 2016
"... Abstract There are so many existing methods to obtain system reliability like regenerating point function technique, supplementary variables technique etc., but all these techniques are full of complicated calculations. Keeping above these facts in mind, the authors in this paper have evaluated so ..."
Abstract
 Add to MetaCart
some reliability parameters for telecommunication system by using Boolean functions technique and algebraic method. Reliability of considered telecommunication system has been evaluated by considering the fact that failures follow arbitrary time distribution. In particular, the reliability expression
Using Linear Algebra for Intelligent Information Retrieval
 SIAM REVIEW
, 1995
"... Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document, lexical ..."
Abstract

Cited by 676 (18 self)
 Add to MetaCart
, lexical methods are necessarily incomplete and imprecise. Using the singular value decomposition (SVD), one can take advantage of the implicit higherorder structure in the association of terms with documents by determining the SVD of large sparse term by document matrices. Terms and documents represented
Algebraic Methods
 In Integer Programming
, 2001
"... An approach for particle sinking velocity measurements in the 3–400 lm size range and considerations on the effect of temperature on sinking rates ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
An approach for particle sinking velocity measurements in the 3–400 lm size range and considerations on the effect of temperature on sinking rates
The Algebraic Method
, 2001
"... Combining the effect of an intermediate renormalization prescription (zero momentum subtraction) and the background field method (BFM), we show that the algebraic renormalization procedure needed for the computation of radiative corrections within noninvariant regularization schemes is drastically s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Combining the effect of an intermediate renormalization prescription (zero momentum subtraction) and the background field method (BFM), we show that the algebraic renormalization procedure needed for the computation of radiative corrections within noninvariant regularization schemes is drastically
An algebraic method for publickey cryptography
 MATHEMATICAL RESEARCH LETTERS
, 1999
"... Algebraic key establishment protocols based on the difficulty of solving equations over algebraic structures are described as a theoretical basis for constructing publickey cryptosystems. ..."
Abstract

Cited by 153 (1 self)
 Add to MetaCart
Algebraic key establishment protocols based on the difficulty of solving equations over algebraic structures are described as a theoretical basis for constructing publickey cryptosystems.
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
 ACM Trans. Math. Software
, 1982
"... An iterative method is given for solving Ax ~ffi b and minU Ax b 112, where the matrix A is large and sparse. The method is based on the bidiagonalization procedure of Golub and Kahan. It is analytically equivalent to the standard method of conjugate gradients, but possesses more favorable numerica ..."
Abstract

Cited by 653 (21 self)
 Add to MetaCart
An iterative method is given for solving Ax ~ffi b and minU Ax b 112, where the matrix A is large and sparse. The method is based on the bidiagonalization procedure of Golub and Kahan. It is analytically equivalent to the standard method of conjugate gradients, but possesses more favorable
The geometry of algorithms with orthogonality constraints
 SIAM J. MATRIX ANAL. APPL
, 1998
"... In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue problems, electronic structures computations, and signal proces ..."
Abstract

Cited by 640 (1 self)
 Add to MetaCart
processing. In addition to the new algorithms, we show how the geometrical framework gives penetrating new insights allowing us to create, understand, and compare algorithms. The theory proposed here provides a taxonomy for numerical linear algebra algorithms that provide a top level mathematical view
Unsupervised Learning by Probabilistic Latent Semantic Analysis
 Machine Learning
, 2001
"... Abstract. This paper presents a novel statistical method for factor analysis of binary and count data which is closely related to a technique known as Latent Semantic Analysis. In contrast to the latter method which stems from linear algebra and performs a Singular Value Decomposition of cooccurren ..."
Abstract

Cited by 618 (4 self)
 Add to MetaCart
Abstract. This paper presents a novel statistical method for factor analysis of binary and count data which is closely related to a technique known as Latent Semantic Analysis. In contrast to the latter method which stems from linear algebra and performs a Singular Value Decomposition of co
Results 1  10
of
14,775