Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
Abstract—In this paper we have proposed and designed FindingHuMo (Finding Human Motion), a real-time user tracking system for Smart Environments. FindingHuMo can perform device-f...
Debraj De, Wen-Zhan Song, Mingsen Xu, Cheng-Liang ...
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...