In many parallel processing applications, task times have relatively little variability. Accordingly, many nodes will complete a task at approximately the same time. If the applica...
This paper argues that itisimpossible to separate lexicaland encyclopedic knowledge and describes an attempt to build a large lexical database that contains the range of informati...
Martha W. Evens, Joanne Dardaine, Yu-Feng Huang, S...
We present ParaMetric, an automatic evaluation metric for data-driven approaches to paraphrasing. ParaMetric provides an objective measure of quality using a collection of multipl...
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...
We show that any simple planar n-gon can be meshed in linear time by O(n) quadrilaterals with all new angles bounded between 60 and 120 degrees. 1991 Mathematics Subject Classifica...