530 search results - page 46 / 106 » Universal randomized switching |
131
click to vote
TIT
2010
14 years 10 months ago
2010
Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit. We allow for arbitrary chip waveforms and ...
133
click to vote
ISCAS
2008
IEEE
15 years 10 months ago
2008
IEEE
— The lack of robust tamper-proofing techniques in security applications has provided attackers the ability to virtually circumvent mathematically strong cryptographic primitive...
117
click to vote
FC
2007
Springer
15 years 10 months ago
2007
Springer
Responding to the PIN cracking attacks from Berkman and Ostrovsky (FC 2007), we outline a simple solution called salted-PIN. A randomly generated salt value of adequate length (e.g...
142
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
137
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...