6274 search results - page 1228 / 1255 » From query complexity to computational complexity |
139
Voted
IJCAI
1989
15 years 4 months ago
1989
gn problem can be abstractly characterized as a constrained function-to-structure mapping. The de sign task takes as input the specifications of the desired functions of a device...
145
Voted
CCS
2010
ACM
15 years 3 months ago
2010
ACM
We show in this paper how several proposed Physical Unclonable Functions (PUFs) can be broken by numerical modeling attacks. Given a set of challenge-response pairs (CRPs) of a PU...
145
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: The accumulation of high-throughput data greatly promotes computational investigation of gene function in the context of complex biological systems. However, a biologi...
129
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Efficient dissection of large proteins into their structural domains is critical for high throughput proteome analysis. So far, no study has focused on mathematically ...
112
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: Much effort is currently made to develop the Gene Ontology (GO). Due to the dynamic nature of information it addresses, GO undergoes constant updates whose results are...