Our first objective in participating in this domain-specific evaluation campaign is to propose and evaluate various indexing and search strategies for the German, English and Russ...
The busy beaver problem is to find the maximum number of 1’s that can be printed by an n-state Turing machine of a particular type. A critical step in the evaluation of this va...
This paper describes work within the NIST Text REtrieval Conference (TREC) over the last three years in designing and implementing evaluations of Spoken Document Retrieval (SDR) t...
John S. Garofolo, Cedric G. P. Auzanne, Ellen M. V...
Background: Computational biologists use Expectation values (E-values) to estimate the number of solutions that can be expected by chance during a database scan. Here we focus on ...
Many techniques have been proposed to show uncertainty in data visualizations. However, very little is known about their effectiveness in conveying meaningful information. In this ...
Jibonananda Sanyal, Song Zhang, Gargi Bhattachar...