Daniel Sleator

Details der Publikationsliste

Zeitraum

1991 - 2009

Anzahl

27

Co-Autoren

Who Wins Misère Hex? (2009)

Jeffrey Lagarias, Daniel Sleator, J. Lagarias, D. Sleator

Hex is an elegant and fun game that was first popularized by Martin Gardner [4]. The game was invented by Piet Hein in 1942 and was rediscovered by John Nash at Princeton in 1948. Two players...

Properties of Multi-Splay Trees (2009)

Jonathan Derryberry, Daniel Sleator, Chengwen Chris Wang

We show that multi-splay trees have most of the properties that splay trees have. Specifically, we show that multi-splay trees have the following properties: the access lemma, static optimality, the...

Editor A Fast O(1) Priority Queue Implementation for the Simulation Event Set Problem (2008)

Daniel Sleator, Randy Brown

ABSTRACT: A new priority queue implementation for the future event set problem is described in this article. The new implementation is shown experimentally to be O(Z) in queue size for the priority...

and (2008)

Carl Burch, Allan Borodin, Daniel Sleator

learning in metrical task systems

RESEARCH CONTRIBUTIONS Algorithms and Data Structures Practical In-Place Merging (2008)

Daniel Sleator, Bing-chao Huang, Michael A. Langston

ABST.RACT: We present a novel, yet straightfotward linear-time algorithm for merging two sorted lists in a fixed amount of additional space. Constant of proportionality estimates and empirical...

RESIWCH CONTRIBUTIONS Programming Techniques and The World’s Fastest Data Structures (2008)

Daniel Sleator, Andrew W. Appel, Guy, J. Jacobson

ABSTRACT: An efficient backtracking algorithm makes with a large dictionary and the heuristic of selecting possible a very fast program to play the SCRABBLE ” Brand the move with the highest score...

Editor A Fast O(1) Priority Queue Implementation for the Simulation Event Set Problem (2008)

Daniel Sleator, Randy Brown

ABSTRACT: A new priority queue implementation for the future event set problem is described in this article. The new implementation is shown experimentally to be O(Z) in queue size for the priority...

*School of Music (2008)

David Temperley, Daniel Sleator

this article, we present a computational system for analyzing metrical and harmonic structure. The system is designed for Western tonal music, particularly art music of the...

Information Retrieval and Information Theory (2007)

Adam Berger, Jaime Carbonell, Daniel Sleator

Information retrieval is concerned with how to classify information and how to judge the similarity between two objects, such as written documents. As the amount of information available in digital...

Modeling Syntax for Parsing and Translation (2003)

Peter Venable, Daniel Sleator

Syntactic structure is an important component of natural language utterances, for both form and content. Therefore, a variety of applications can benefit from the integration of syntax into their...

Modeling Syntax for Parsing and Translation (2003)

Peter Venable, Daniel Sleator

Syntactic structure is an important component of natural language utterances, for both form and content. Therefore, a variety of applications can benefit from the integration of syntax into their...

Modeling Syntax for Parsing and Translation (2003)

Peter Venable, Daniel Sleator

Syntactic structure is an important component of natural language utterances, for both form and content. Therefore, a variety of applications can benefit from the integration of syntax into their...

Competitive Paging Algorithms (2002)

Fiat, Amos, Karp, Richard, Luby, Mike, McGeoch, Lyle, Sleator, Daniel, Young, Neal E.

The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. This paper introduces the marking algorithm, a simple randomized...

Statistical machine learning for information retrieval (2001)

Adam Berger, Daniel Sleator

representing the official policies, either expressed or implied, of IBM Corporation, JustSystem Corporation,

Link Grammar Parser (2000)

Daniel Sleator, Davy Temperley, John Laffferty

The Link Grammar Parser is a syntactic parser of English, based on link grammar, an original theory of English syntax. Given a sentence, the system assigns to it a syntactic structure, which consists...

Information Retrieval and Information Theory (1999)

Adam Berger, Jaime Carbonell, Daniel Sleator

Information retrieval is concerned with how to classify information and how to judge the similarity between two objects, such as written documents. As the amount of information available in digital...

A Numerical Optimization Approach to General Graph Drawing. (1998)

Tunkelang, Daniel, Sleator, Daniel, Heckbert, Paul, Maggs, Bruce

Graphs are ubiquitous, finding applications in domains ranging from software engineering to computational biology. While graph theory and graph algorithms are some of the oldest, most studied fields...

Grammatical Trigrams: A New Approach To Statistical Language Modeling (1997)

Daniel Sleator, John Lafferty

this paper appears in Proceedings of the Third International Workshop on Parsing Technologies, 1993.

A Robust Parsing Algorithm For Link Grammars (1995)

Grinberg, Dennis, Lafferty, John, Sleator, Daniel

In this paper we present a robust parsing algorithm based on the link grammar formalism for parsing natural languages. Our algorithm is a natural extension of the original dynamic programming...

A Robust Parsing Algorithm for Link Grammars (1995)

Dennis Grinberg, John Lafferty, Daniel Sleator

In this paper we present a robust parsing algorithm based on the link grammar formalism for parsing natural languages. Our algorithm is a natural extension of the original dynamic programming...

A Robust Parsing Algorithm For Link Grammars (1995)

Dennis Grinberg John, John Lafferty, Daniel Sleator

In this paper we present a robust parsing algorithm based on the link grammar formalism for parsing natural languages. Our algorithm is a natural extension of the original dynamic programming...

Grammatical Trigrams: A Probabilistic Model of Link Grammar (1992)

John Lafferty Daniel, Daniel Sleator, Davy Temperley

In this paper we present a new class of language models. This class derives from link grammar, a context-free formalism for the description of natural language. We describe an algorithm for...

Grammatical Trigrams: A Probabilistic Model of Link Grammar (1992)

John Lafferty, Daniel Sleator, Davy Temperley

In this paper we present a new class of language models. This class derives from link grammar, a context-free formalism for the description of natural language. We describe an algorithm for...

Grammatical Trigrams: A Probabilistic Model of Link Grammar (1992)

John Lafferty, Daniel Sleator, Davy Temperley

In this paper we present a new class of language models. This class derives from link grammar, a context-free formalism for the description of natural language. We describe an algorithm for...

Computer Analysis of Sprouts (1991)

David Applegate, Guy Jacobson, Daniel Sleator

Sprouts is a two-player pencil-and-paper game with a topological flavor. It was invented in 1967 by Michael Paterson and John Conway, and was popularized by Martin Gardner in the Mathematical Games...

Computer Analysis of Sprouts (1991)

David Applegate Guy, Guy Jacobson, Daniel Sleator

Sprouts is a two-player pencil-and-paper game with a topological flavor. It was invented in 1967 by Michael Paterson and John Conway, and was popularized by Martin Gardner in the Mathematical Games...

Parsing English with a Link Grammar (1991)

Daniel Sleator, Davy Temperley

A link grammar is a new formal grammatical system. A sequence of words is in the language of the link grammar if there is a way to draw links between words in such a way that (1) the local...