Sciweavers

176 search results - page 25 / 36
» Topics in the theory of DNA computing
Sort
View
MST
2006
149views more  MST 2006»
14 years 11 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
204
Voted

Lecture Notes
404views
16 years 9 months ago
Network Security
A comprehensive treatment of network security. Topics include remote access security, DMZ, firewalls, VPNs, PKI architecture, X.509 Public key infrastructure, web security, S-HTTP,...
Raj Jain
83
Voted
CHI
2007
ACM
16 years 4 days ago
Investigating attractiveness in web user interfaces
A theoretical framework for assessing the attractiveness of websites based on Adaptive Decision Making theory is introduced. The framework was developed into a questionnaire and u...
Jan Hartmann, Alistair G. Sutcliffe, Antonella De ...
IJSE
2010
138views more  IJSE 2010»
14 years 9 months ago
Modeling the Experience of Emotion
Affective computing has proven to be a viable field of research comprised of a large number of multidisciplinary researchers resulting in work that is widely published. The majori...
Joost Broekens
JCB
2002
70views more  JCB 2002»
14 years 11 months ago
Strong Feature Sets from Small Samples
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, ...
Seungchan Kim, Edward R. Dougherty, Junior Barrera...