In the context of information retrieval, traditional collection selection algorithms have been widely studied. These algorithms utilize language models, a representation of the co...
Gary A. Monroe, James C. French, Allison L. Powell
An empirical study has been conducted investigating the relationship between the performance of a generative language model in terms of perplexity and the corresponding informatio...
Leif Azzopardi, Mark Girolami, Keith van Rijsberge...
We define simple-regular expressions and languages. Simple-regular languages provide a necessary condition for a language to be outfix-free. We design algorithms that compute si...
Hierarchical algorithms such as multigrid applications form an important cornerstone for scientific computing. In this study, we take a first step toward evaluating parallel lan...
Bradford L. Chamberlain, Steven J. Deitz, Lawrence...
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...