Sciweavers

8949 search results - page 1431 / 1790
» is 1998
Sort
View
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 11 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
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) ...
Daniel Lewin, Salil P. Vadhan
194
Voted
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
15 years 11 months ago
Analysis of Low Density Codes and Improved Designs Using Irregular Graphs
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 ...
ECAI
1998
Springer
15 years 11 months ago
The Neural Path to Dialogue Acts
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...
M. Kipp
139
Voted
UIST
1998
ACM
15 years 11 months ago
Interactive Visualization of Serial Periodic Data
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...
John V. Carlis, Joseph A. Konstan
133
Voted
UIST
1998
ACM
15 years 11 months ago
A Negotiation Architecture for Fluid Documents
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,...
« Prev « First page 1431 / 1790 Last » Next »