8825 search results - page 281 / 1765 » All for one or one for all |
115
Voted
TCC
2009
Springer
16 years 2 months ago
2009
Springer
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
112
Voted
CHI
2008
ACM
16 years 2 months ago
2008
ACM
We present a pair of experiments that explore the effects of tactile-feedback and direct vs. indirect pen input on pointing and crossing selection tasks. While previous work has d...
150
click to vote
SIGMOD
2006
ACM
16 years 1 months ago
2006
ACM
Main memory is a critical resource when processing longrunning queries over data streams with state intensive operators. In this work, we investigate state spill strategies that h...
92
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
102
click to vote
ALT
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the ...