We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
We consider a problem which was stated in a request for comments made by NIST in the FIPS97 document. The question is the following: Can we have a digital signature public key infr...
We present ActMiner, which addresses four major challenges to data stream classification, namely, infinite length, concept-drift, conceptevolution, and limited labeled data. Most o...
Mohammad M. Masud, Jing Gao, Latifur Khan, Jiawei ...
The problem of information overload has been addressed by several systems. However, many approaches are limited to informal artifacts and need to refer to the user for reference o...