An explicit construction will be presented of t-i.p.p. codes of rate bounded away from zero, for which identification can be accomplished with complexity poly(n).
Let C be a code of length n over a q-ary alphabet. An n-word y is called a descendant of a set of t codewords x^1,...,x^t if y_iin {x^1_i,dots,x^t_i} for all i=1,...,n.
An explicit construction is presented of t-i.p.p. codes of rate bounded away from zero, for which identification can be accomplished with complexity poly(n).
In a classic paper,1 Campbell and Foster defined a class of networks suitable for use as anti-sidetone networks in telephone sets.
This paper introduces a class of methods called TES (Transform-Expand-Sample) for generating correlated variates with uniform marginals and Markovian structure.
We present a class of variational wavefunctions for strong coupling Heinsenberg Hubbard models.
A novel approach is presented to class-based language modeling based on part-of-speech statistics.
Quantum search is a quantum mechanical technique for searching N possibilities in only O (square root of N) steps.
Quantum search is a quantum mechanical technique for searing N possibilities in only O( sq rt. N) steps.
The purpose of this project is to implement a clause evaluator in the language QUEL/C running under the UNIX(TM) operating system using the INGRES database system
