Sciweavers

8949 search results - page 1644 / 1790
» is 1998
Sort
View
TCC
2009
Springer
117views Cryptology» more  TCC 2009»
16 years 7 months ago
Towards a Theory of Extractable Functions
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
Ran Canetti, Ronny Ramzi Dakdouk
KDD
2002
ACM
147views Data Mining» more  KDD 2002»
16 years 7 months ago
Sequential cost-sensitive decision making with reinforcement learning
Recently, there has been increasing interest in the issues of cost-sensitive learning and decision making in a variety of applications of data mining. A number of approaches have ...
Edwin P. D. Pednault, Naoki Abe, Bianca Zadrozny
CHI
2005
ACM
16 years 7 months ago
Towards knowledge building in professional groups
In this submission for the CHI05 Development forum, I reflect on my experience leading the Experience Design community of interest of the American Institute of Graphic Arts and su...
John Zapolski
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
16 years 6 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
STACS
2010
Springer
16 years 1 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
« Prev « First page 1644 / 1790 Last » Next »