Sciweavers

99 search results - page 19 / 20
» The Complexity of Quantitative Information Flow Problems
Sort
View
DSN
2004
IEEE
13 years 10 months ago
Verifying Web Applications Using Bounded Model Checking
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
KDD
2002
ACM
148views Data Mining» more  KDD 2002»
14 years 6 months ago
Tumor cell identification using features rules
Advances in imaging techniques have led to large repositories of images. There is an increasing demand for automated systems that can analyze complex medical images and extract me...
Bin Fang, Wynne Hsu, Mong-Li Lee
EUROSYS
2007
ACM
14 years 3 months ago
Melange: creating a "functional" internet
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...
Anil Madhavapeddy, Alex Ho, Tim Deegan, David Scot...
CRYPTO
2003
Springer
132views Cryptology» more  CRYPTO 2003»
13 years 11 months ago
On Cryptographic Assumptions and Challenges
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
Moni Naor
BMCBI
2005
201views more  BMCBI 2005»
13 years 6 months ago
Principal component analysis for predicting transcription-factor binding motifs from array-derived data
Background: The responses to interleukin 1 (IL-1) in human chondrocytes constitute a complex regulatory mechanism, where multiple transcription factors interact combinatorially to...
Yunlong Liu, Matthew P. Vincenti, Hiroki Yokota