Sciweavers

152 search results - page 28 / 31
» Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
Sort
View
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
14 years 3 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
DLOG
2009
13 years 6 months ago
Explaining by Example: Model Exploration for Ontology Comprehension
Abstract. In this paper, we describe an approach for ontology comprehension support called model exploration in which models for ontologies are generated and presented interactivel...
Johannes Bauer, Ulrike Sattler, Bijan Parsia
BMCBI
2010
178views more  BMCBI 2010»
13 years 8 months ago
Applications of a formal approach to decipher discrete genetic networks
Background: A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant...
Fabien Corblin, Eric Fanchon, Laurent Trilling
ICLP
2007
Springer
14 years 11 days ago
Web Sites Verification: An Abductive Logic Programming Tool
We present the CIFFWEB system, an innovative tool for the verification of web sites, relying upon abductive logic programming. The system allows the user to define rules that a web...
Paolo Mancarella, Giacomo Terreni, Francesca Toni
KCAP
2011
ACM
12 years 11 months ago
Let's agree to disagree: on the evaluation of vocabulary alignment
Gold standard mappings created by experts are at the core of alignment evaluation. At the same time, the process of manual evaluation is rarely discussed. While the practice of ha...
Anna Tordai, Jacco van Ossenbruggen, Guus Schreibe...