Sciweavers

747 search results - page 148 / 150
» Theory and Construction of Molecular Computers
Sort
View
101
Voted
CCS
2010
ACM
14 years 12 months ago
Modeling attacks on physical unclonable functions
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...
Ulrich Rührmair, Frank Sehnke, Jan Sölte...
BMCBI
2010
147views more  BMCBI 2010»
14 years 11 months ago
Learning biological network using mutual information and conditional independence
Background: Biological networks offer us a new way to investigate the interactions among different components and address the biological system as a whole. In this paper, a revers...
Dong-Chul Kim, Xiaoyu Wang, Chin-Rang Yang, Jean G...
AIS
2006
Springer
14 years 11 months ago
Togetherness and respect: ethical concerns of privacy in Global Web Societies
Today's computer network technologies are sociologically founded on hunter-gatherer principles; common users may be possible subjects of surveillance and sophisticated Interne...
Gordana Dodig-Crnkovic, Virginia Horniak
FSS
2006
140views more  FSS 2006»
14 years 11 months ago
Advances and challenges in interval-valued fuzzy logic
Among the various extensions to the common [0, 1]-valued truth degrees of "traditional" fuzzy set theory, closed intervals of [0, 1] stand out as a particularly appealin...
Chris Cornelis, Glad Deschrijver, Etienne E. Kerre
JAIR
2008
102views more  JAIR 2008»
14 years 11 months ago
An Ordinal Bargaining Solution with Fixed-Point Property
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
Dongmo Zhang, Yan Zhang