1066 search results - page 82 / 214 » Computing Private Set Operations with Linear Complexities |
112
Voted
ICTCS
2007
Springer
15 years 9 months ago
2007
Springer
The information flow property of Non-Interference was recently relaxed into Abstract NonInterference (ANI), a weakened version where attackers can only observe properties of data,...
123
Voted
SIAMCOMP
2000
15 years 2 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
118
Voted
TJS
2008
15 years 2 months ago
2008
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
118
Voted
CCA
2000
Springer
15 years 7 months ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
116
Voted
ENTCS
2007
15 years 2 months ago
2007
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...