Sciweavers

20807 search results - page 3958 / 4162
» How to read a paper
Sort
View
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
14 years 2 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
VLDB
1994
ACM
149views Database» more  VLDB 1994»
14 years 2 months ago
Qualified Answers That Reflect User Needs and Preferences
This paper introduces a formalism to describe the needs and preferences of database users. Because of the precise formulation of these concepts, we have found an automatic and ver...
Terry Gaasterland, Jorge Lobo
SC
1992
ACM
14 years 2 months ago
Willow: A Scalable Shared Memory Multiprocessor
We are currently developing Willow, a shared-memory multiprocessor whose design provides system capacity and performance capable of supporting over a thousand commercial microproc...
John K. Bennett, Sandhya Dwarkadas, Jay A. Greenwo...
SIGGRAPH
1992
ACM
14 years 2 months ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder
STACS
1992
Springer
14 years 2 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
« Prev « First page 3958 / 4162 Last » Next »