Sciweavers

8723 search results - page 1654 / 1745
» A New Analysis of Co-Training
Sort
View
SIGMOD
1993
ACM
163views Database» more  SIGMOD 1993»
15 years 10 months ago
The LRU-K Page Replacement Algorithm For Database Disk Buffering
This paper introduces a new approach to database disk buffering, called the LRU–K method. The basic idea of LRU–K is to keep track of the times of the last K references to pop...
Elizabeth J. O'Neil, Patrick E. O'Neil, Gerhard We...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 10 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
CTCS
1989
Springer
15 years 10 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
SIGGRAPH
1992
ACM
15 years 10 months ago
Generative modeling: a symbolic system for geometric modeling
This paper discusses a new, symbolic approach to geometric modeling called generative modeling. The approach allows specification, rendering, and analysis of a wide variety of sha...
John M. Snyder, James T. Kajiya
STACS
1992
Springer
15 years 10 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 1654 / 1745 Last » Next »