We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
Satya N. Majumdar, David S. Dean, Paul L. Krapivsk...
This paper integrates expectancy disconfirmation theory and justice theory to construct a model for investigating the motivations behind people’s knowledge sharing in open profe...
Chao-Min Chiu, Eric T. G. Wang, Fu-Jong Shih, Yi-W...
Understanding the dynamics of technology evolution—whether for the purposes of forecasting new product or technology infrastructure developments, or identifying the basis for fu...
Gediminas Adomavicius, Jesse Bockstedt, Alok Gupta...
This paper addresses a simple, yet fundamental question in the design of peer-to-peer systems: What does it mean when we say “availability” and how does this understanding imp...
Ranjita Bhagwan, Stefan Savage, Geoffrey M. Voelke...
In this paper we present an approach to recognition confidence scoring and a set of techniques for integrating confidence scores into the understanding and dialogue components of ...
Timothy J. Hazen, Stephanie Seneff, Joseph Polifro...