1066 search results - page 31 / 214 » Computing Private Set Operations with Linear Complexities |
101
click to vote
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
ARITH
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...