1066 search results - page 179 / 214 » Computing Private Set Operations with Linear Complexities |
100
click to vote
JSYML
2007
14 years 9 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
92
Voted
WOSP
2010
ACM
15 years 4 months ago
2010
ACM
Performance non-determinism in computer systems complicates evaluation, use, and even development of these systems. In performance evaluation via benchmarking and simulation, nond...
120
click to vote
QCQC
1998
Springer
15 years 1 months ago
1998
Springer
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
ANCS
2007
ACM
15 years 1 months ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
PLDI
2010
ACM
15 years 2 months ago
2010
ACM
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...