We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
This paper presents a neural network approach to the problem of nding the dialogue act for a given utterance. So far only symbolic, decision tree and statistical approaches were ut...
Serial periodic data exhibit both serial and periodic properties. For example, time continues forward serially, but weeks, months, and years are periods that recur. While there ar...
The information presented in a document often consists of primary content as well as supporting material such as explanatory notes, detailed derivations, illustrations, and the li...
Bay-Wei Chang, Jock D. Mackinlay, Polle Zellweger,...