Sciweavers

490 search results - page 73 / 98
» Impossibilities for roommate problems
Sort
View
FOCS
2006
IEEE
14 years 3 months ago
On the Compressibility of NP Instances and Cryptographic Applications
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...
Danny Harnik, Moni Naor
SIGECOM
2010
ACM
201views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
Truthful assignment without money
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...
Shaddin Dughmi, Arpita Ghosh
ASIACRYPT
2000
Springer
14 years 1 months ago
Towards Signature-Only Signature Schemes
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...
Adam Young, Moti Yung
PAKDD
2010
ACM
165views Data Mining» more  PAKDD 2010»
13 years 11 months ago
Classification and Novel Class Detection in Data Streams with Active Mining
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 ...
LWA
2008
13 years 10 months ago
Towards CoPing with Information Overload
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...
Christine Müller