1793 search results - page 159 / 359 » On the Design of Codes for DNA Computing |
225
Voted
JCB
2002
15 years 6 months ago
2002
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
158
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
Code libraries are characterized by feature-richness — and, consequently, high overhead. The library specialization problem is the problem of obtaining a low-overhead version of...
210
click to vote
SC
2000
ACM
15 years 11 months ago
2000
ACM
This is a project for developing a distributed job execution environment for highly iterative jobs. An iterative job is one where the same binary code is run hundreds of times wit...
173
click to vote
DAC
2012
ACM
13 years 9 months ago
2012
ACM
Unknown values (Xs) may exist in a design due to uninitialized registers or blocks that are powered down. Due to X-pessimism in gate-level logic simulation, such Xs cannot be hand...
207
click to vote
TCSV
2008
15 years 6 months ago
2008
Abstract--The H.264 standard achieves much higher coding efficiency than the MPEG-2 standard, due to its improved inter-and intra-prediction modes at the expense of higher computat...