406 search results - page 12 / 82 » Pseudorandomness and Combinatorial Constructions |
158
click to vote
ECCC
1998
15 years 5 months ago
1998
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
139
click to vote
PKC
2010
Springer
15 years 8 months ago
2010
Springer
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
110
click to vote
JCT
2006
15 years 6 months ago
2006
Frequency-hopping multiple-access (FHMA) spread spectrum communication systems employing multiple frequency shift keying as data modulation technique were investigated by Fuji-Har...
153
click to vote
DMIN
2009
15 years 3 months ago
2009
- This paper demonstrates how methods borrowed from information fusion can improve the performance of a classifier by constructing (i.e., fusing) new features that are combinations...
144
click to vote
ECCC
2007
15 years 6 months ago
2007
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constan...