1120 search results - page 153 / 224 » time 1999 |
109
Voted
STOC
2006
ACM
16 years 29 days 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...
134
Voted
ICARIS
2007
Springer
15 years 6 months ago
2007
Springer
Today’s signature-based intrusion detection systems are reactive in nature and storage-limited. Their operation depends upon catching an instance of an intrusion or virus and en...
EUROCRYPT
2001
Springer
15 years 5 months ago
2001
Springer
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
93
Voted
FSTTCS
2001
Springer
15 years 5 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
107
Voted
ACSAC
1999
IEEE
15 years 5 months ago
1999
IEEE
Uncorrupted log files are the critical system component for computer forensics in case of intrusion and for real time system monitoring and auditing. Protection from tampering wit...