We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
Abstract Since the concept of private information retrieval (PIR) was first formalized by Chor et. al, various constructions have been proposed with a common goal of reducing commu...
Xuhua Ding, Yanjiang Yang, Robert H. Deng, Shuhong...
A method of `network filtering' has been proposed recently to detect the effects of certain external perturbations on the interacting members in a network. However, with larg...
Using Web information in example-based dialogue systems is considered to be a good way to increase the topical relevance of system responses. However, Web content is mostly written...
This paper describes how to generate compositions of semantic Web services using social trust information from user ratings of the services. We present a taxonomy of features, suc...