156 search results - page 26 / 32 » In Search of Optimal Codes for DNA Computing |
CASES
2004
ACM
15 years 1 months ago
2004
ACM
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
TC
2008
14 years 9 months ago
2008
Cryptanalysis of ciphers usually involves massive computations. The security parameters of cryptographic algorithms are commonly chosen so that attacks are infeasible with availabl...
115
click to vote
CVPR
2010
IEEE
15 years 22 days ago
2010
IEEE
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, ...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Evolutionary algorithms have successfully been applied to software testing. Not only approaches that search for numeric test data for procedural test objects have been investigate...
88
Voted
LOPSTR
2004
Springer
15 years 2 months ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...