Search computing is a novel discipline whose goal is to answer complex, multi-domain queries. Such queries typically require combining in their results domain knowledge extracted ...
In a Wizard-of-Oz experiment with multiple wizard subjects, each wizard viewed automated speech recognition (ASR) results for utterances whose interpretation is critical to task s...
Rebecca J. Passonneau, Susan L. Epstein, Tiziana L...
Abstract. As an alternative to message passing, Rochester's InterWeave system allows the programmer to map shared segments into programs spread across heterogeneous, distribut...
The increased use of ubiquitous computing devices is resulting in networks that are highly mobile, well connected and growing in processing and storage capabilities. The nature of ...
Rudi Ball, James Grant, Jonathan So, Victoria Spur...
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...