Sciweavers

927 search results - page 176 / 186
» Who supports the support workers
Sort
View
COLING
1996
13 years 8 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
OSDI
1996
ACM
13 years 8 months ago
Automatic Compiler-Inserted I/O Prefetching for Out-of-Core Applications
Current operating systems offer poor performance when a numeric application's working set does not fit in main memory. As a result, programmers who wish to solve "out-of...
Todd C. Mowry, Angela K. Demke, Orran Krieger
ACMDIS
2010
ACM
13 years 7 months ago
Incorporating user control in automated interactive scheduling systems
In this paper, we report our findings on the impact of providing users with varying degrees of control in an automated interactive scheduling system. While automated scheduling te...
Jina Huh, Martha E. Pollack, Hadi Katebi, Karem A....
ACMDIS
2010
ACM
13 years 7 months ago
A tale of two publics: democratizing design at the margins
The design and use of Information and Communication Technology (ICT) has now evolved beyond its workplace origins to the wider public, expanding to people who live at the margins ...
Christopher A. Le Dantec, Jim Christensen, Mark Ba...
APLAS
2010
ACM
13 years 7 months ago
Typechecking Higher-Order Security Libraries
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
Karthikeyan Bhargavan, Cédric Fournet, Nata...