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...
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...
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....
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...
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...