Sciweavers

3378 search results - page 258 / 676
» A universe of binding and computation
Sort
View
SIGUCCS
2000
ACM
15 years 11 months ago
Implementing Assistive Technology: Opportunities and Challenges
In this paper, I describe some of the challenges and opportunities presented when attempting to be proactive in improving the accessibility of the University of North Carolina at ...
Janice K. Tulloss
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
15 years 10 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
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 10 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
ACL
2008
15 years 8 months ago
Generating Research Websites Using Summarisation Techniques
We describe an application that generates web pages for research institutions by summarising terms extracted from individual researchers' publication titles. Our online demo ...
Advaith Siddharthan, Ann A. Copestake
DAGSTUHL
2006
15 years 8 months ago
Complexity Monotone in Conditions and Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true dis...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...