9507 search results - page 1706 / 1902 » Time-based language models |
167
Voted
ASPLOS
1996
ACM
15 years 9 months ago
1996
ACM
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
139
click to vote
ASPLOS
1992
ACM
15 years 9 months ago
1992
ACM
We describe and evaluate a strategy for declustering the parity encoding in a redundant disk array. This declustered parity organization balances cost against data reliability and...
185
click to vote
PODS
1994
ACM
15 years 9 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
133
click to vote
CTCS
1989
Springer
15 years 9 months ago
1989
Springer
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...
151
click to vote
CICLING
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. The automatic detection of shared content in written documents –which includes text reuse and its unacknowledged commitment, plagiarism– has become an important probl...