Sciweavers

248 search results - page 20 / 50
» acm 1992
Sort
View
SODA
1992
ACM
116views Algorithms» more  SODA 1992»
14 years 11 months ago
On Playing "Twenty Questions" with a Liar
We consider a version of the game "Twenty Questions" played on the set {0,
Aditi Dhagat, Péter Gács, Peter Wink...
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
15 years 2 months ago
Randomized versus Nondeterministic Communication Complexity
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
Paul Beame, Joan Lawry
SODA
1992
ACM
90views Algorithms» more  SODA 1992»
14 years 11 months ago
Self-Testing Polynomial Functions Efficiently and Over Rational Domains
In this paper we give the first self-testers and checkers for polynomials over rational and integer domains. We also show significantly stronger bounds on the efficiency of a simp...
Ronitt Rubinfeld, Madhu Sudan
ELPUB
1999
ACM
15 years 2 months ago
Project Runeberg's Electronic Facsimile Editions of Nordic Literature
Project Runeberg has been publishing Nordic literature on the Internet since 1992. The project is based at Linköping University, Sweden. In the fall of 1998 a series of experimen...
Lars Aronsson
ACMSE
1992
ACM
15 years 2 months ago
Using an on-line dictionary to extract a list of sense-disambiguated synonyms
The feasibility of extracting both explicit and implicit synonym references from a machine readable dictionary is investigated; the extracted synonyms, both symmetric and asymmetr...
Jan G. Wilms