3190 search results - page 44 / 638 » cans 2011 |
143
click to vote
ASIACRYPT
2011
Springer
14 years 14 days ago
2011
Springer
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
107
Voted
TMC
2011
14 years 7 months ago
2011
—Pocket Switched Networks take advantage of social contacts to opportunistically create data paths over time. This work employs empirical traces to examine the effect of the huma...
126
Voted
CANS
2011
Springer
14 years 14 days ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
116
click to vote
PEPM
2011
ACM
14 years 3 months ago
2011
ACM
Passing multiple continuation arguments to a function in CPS form allows one to encode a wide variety of direct-style control constructs, such as conditionals, exceptions, and mul...
126
click to vote
ACL
2012
13 years 2 months ago
2012
One of the key tasks for analyzing conversational data is segmenting it into coherent topic segments. However, most models of topic segmentation ignore the social aspect of conver...