Sciweavers

7228 search results - page 630 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
15 years 8 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe
DGO
2008
126views Education» more  DGO 2008»
15 years 8 months ago
Active learning for e-rulemaking: public comment categorization
We address the e-rulemaking problem of reducing the manual labor required to analyze public comment sets. In current and previous work, for example, text categorization techniques...
Stephen Purpura, Claire Cardie, Jesse Simons
TSP
2008
151views more  TSP 2008»
15 years 7 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
CRYPTO
2011
Springer
237views Cryptology» more  CRYPTO 2011»
14 years 7 months ago
Bi-Deniable Public-Key Encryption
In CRYPTO 1997, Canetti et al.put forward the intruiging notion of deniable encryption, which (informally) allows a sender and/or receiver, having already performed some encrypted...
Adam O'Neill, Chris Peikert, Brent Waters
COMAD
2009
15 years 8 months ago
Graph Clustering for Keyword Search
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Rose Catherine K., S. Sudarshan