Sciweavers

3318 search results - page 650 / 664
» The Weak Instance Model
Sort
View
APLAS
2010
ACM
13 years 10 months ago
Typechecking Higher-Order Security Libraries
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
Karthikeyan Bhargavan, Cédric Fournet, Nata...
AAAI
2010
13 years 10 months ago
Computing Cost-Optimal Definitely Discriminating Tests
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Anika Schumann, Jinbo Huang, Martin Sachenbacher
AMAI
2008
Springer
13 years 10 months ago
Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
Patrick Amstutz, Nikolaus Correll, Alcherio Martin...
BMCBI
2010
138views more  BMCBI 2010»
13 years 10 months ago
A model-independent approach to infer hierarchical codon substitution dynamics
Background: Codon substitution constitutes a fundamental process in molecular biology that has been studied extensively. However, prior studies rely on various assumptions, e.g. r...
Olof Görnerup, Martin Nilsson Jacobi
BMCBI
2007
125views more  BMCBI 2007»
13 years 10 months ago
Statistical tests to compare motif count exceptionalities
Background: Finding over- or under-represented motifs in biological sequences is now a common task in genomics. Thanks to p-value calculation for motif counts, exceptional motifs ...
Stéphane Robin, Sophie Schbath, Vincent Van...