Sciweavers

117 search results - page 22 / 24
» Why Cryptosystems Fail
Sort
View
DLS
2008
149views Languages» more  DLS 2008»
13 years 9 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
IJCAI
1997
13 years 8 months ago
Exploiting Domain Knowledge for Approximate Diagnosis
The AI literature contains many definitions of diagnostic reasoning most of which are defined in terms of the logical entailment relation. We use existing work on approximate en...
Annette ten Teije, Frank van Harmelen
CCS
2010
ACM
13 years 7 months ago
Attacks and design of image recognition CAPTCHAs
We systematically study the design of image recognition CAPTCHAs (IRCs) in this paper. We first review and examine all IRCs schemes known to us and evaluate each scheme against th...
Bin B. Zhu, Jeff Yan, Qiujie Li, Chao Yang, Jia Li...
SOFTVIS
2010
ACM
13 years 7 months ago
Heapviz: interactive heap visualization for program understanding and debugging
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
Edward Aftandilian, Sean Kelley, Connor Gramazio, ...
BMCBI
2007
105views more  BMCBI 2007»
13 years 7 months ago
Generating confidence intervals on biological networks
Background: In the analysis of networks we frequently require the statistical significance of some network statistic, such as measures of similarity for the properties of interact...
Thomas Thorne, Michael P. H. Stumpf