1224 search results - page 211 / 245 » Design and Implementation of a Practical Parallel Delaunay A... |
122
click to vote
CHES
1999
Springer
15 years 6 months ago
1999
Springer
The strength of a cryptographic function depends on the amount of entropy in the cryptovariables that are used as keys. Using a large key length with a strong algorithm is false co...
108
click to vote
DAC
2001
ACM
16 years 2 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
126
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
Mapping biology into computation has both a domain specific aspect – biological theory – and a methodological aspect – model development. Computational modelers have implici...
156
Voted
PPOPP
2006
ACM
15 years 8 months ago
2006
ACM
Applications need to become more concurrent to take advantage of the increased computational power provided by chip level multiprocessing. Programmers have traditionally managed t...
132
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...