The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...
Abstract. Peer Data Management Systems (PDMS) have recently attracted attention by the database community. One of the main challenges of this paradigm is the development and evalua...
Katja Hose, Andreas Job, Marcel Karnstedt, Kai-Uwe...
In our previous work, we have designed, using a network-based approach, and are currently deploying on Purdue wireless Infrastructure, a Web service for location discovery of 802....
Simon G. M. Koo, Catherine Rosenberg, Hoi-Ho Chan,...
Maximum margin clustering (MMC) has recently attracted considerable interests in both the data mining and machine learning communities. It first projects data samples to a kernel...