778 search results - page 64 / 156 » Improved universal denominators |
TCC
2009
Springer
15 years 10 months ago
2009
Springer
We present a compiler for transforming an oblivious transfer (OT) protocol secure against an adaptive semi-honest adversary into one that is secure against an adaptive malicious ad...
CHI
2008
ACM
15 years 10 months ago
2008
ACM
We propose an e-learning scenario where eye tracking is exploited to get valuable data about user behavior. What we look at -- as well as how we do that -- can in fact be used to ...
CADE
2004
Springer
15 years 10 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
Abstract. We present a deterministic O(log n log log n) space algorithm for undirected stconnectivity. It is based on a space-efficient simulation of the deterministic EREW algorit...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...