We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator...
Erik D. Demaine, Dion Harmon, John Iacono, Mihai P...
During processor design, it is often necessary to evaluate multiple cache configurations. This paper describes the design and implementation of a retargetable on-line cache simula...
Abstract. Availability of real-time speech transcription anywhere, anytime, represents a potentially life-changing opportunity for the hearingimpaired to improve their communicatio...
When an offence occurs, the victim and offender can overcome the harm done through forgiveness. This paper demonstrates how forgiveness can be supported in social system design. W...
Asimina Vasalou, Jens Riegelsberger, Adam N. Joins...
We evaluate the Berkeley parser on text from an online discussion forum. We evaluate the parser output with and without gold tokens and spellings (using Sparseval and Parseval), a...