Automatic service composition is an active research area in the field of service computing. This paper presents a distributed approach to automatically discover a composition of s...
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
To achieve reasonable accuracy in large vocabulary speech recognition systems, it is important to use detailed acoustic models together with good long span language models. For ex...
J. J. Odell, V. Valtchev, Philip C. Woodland, S. J...
This paper presents approaches for building, managing, and evaluating consensus ontologies from the individual ontologies of a network of socially interacting agents. Each agent h...
We propose a method for discovering the dependency relationships between the topics of documents shared in social networks using the latent social interactions, attempting to answ...