2693 search results - page 151 / 539 » On Computing Complex Navigation Functions |
175
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: The abundant data available for protein interaction networks have not yet been fully understood. New types of analyses are needed to reveal organizational principles o...
201
click to vote
BIBM
2009
IEEE
16 years 1 months ago
2009
IEEE
Background: Similaritysearch in chemical structure databases is an important problem with many applications in chemical genomics, drug design, and efficient chemical probe screeni...
169
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
186
click to vote
IJCAI
1989
15 years 7 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...
182
click to vote
CCS
2010
ACM
15 years 6 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...