1224 search results - page 211 / 245 » Design and Implementation of a Practical Parallel Delaunay A... |
182
click to vote
CHES
1999
Springer
15 years 11 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...
179
Voted
DAC
2001
ACM
16 years 7 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 ...
194
click to vote
GECCO
2005
Springer
16 years 9 days 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...
221
Voted
PPOPP
2006
ACM
16 years 22 days 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...
210
Voted
SPAA
2003
ACM
16 years 17 hour 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...