Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
In global computing applications the availability of a mechanism for some form of committed choice can be useful, and sometimes necessary. It can conveniently handle, e.g., distrib...
This work aims to extract causal relations that exist between two events expressed by noun phrases or sentences. The previous works for the causality made use of causal patterns su...
This paper presents a prototype dialogue system, K2, in which a user can instruct agents through speech input to manipulate various objects in a 3-D virtual world. The agents’ ac...
Web services are in the midst of making the transition from being a promising technology to being widely used in the industry. However, most efforts to use Web services have been m...
Preeda Rajasekaran, John A. Miller, Kunal Verma, A...