Sciweavers

2576 search results - page 143 / 516
» The Complexity of Zero Knowledge
Sort
View
STOC
2002
ACM
80views Algorithms» more  STOC 2002»
16 years 5 months ago
Strict polynomial-time in simulation and extraction
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
Boaz Barak, Yehuda Lindell
133
Voted
SEMCO
2007
IEEE
15 years 11 months ago
Corpus-based Pattern Induction for a Knowledge-based Question Answering Approach
In this paper, we present an approach which, given a knowledge base and an appropriate text corpus, automatically induces patterns which can be used to query the knowledge base. W...
Philipp Cimiano, Michael Erdmann, Günter Ladw...
VL
2007
IEEE
132views Visual Languages» more  VL 2007»
15 years 11 months ago
A Study on Applying Roles of Variables in Introductory Programming
Expert programmers possess programming knowledge, which is language independent and abstract. Still, programming is mostly taught only via constructs of a programming language and...
Pauli Byckling, Jorma Sajaniemi
155
Voted
EWCBR
2004
Springer
15 years 10 months ago
Explanations and Case-Based Reasoning: Foundational Issues
By design, Case-Based Reasoning (CBR) systems do not need deep general knowledge. In contrast to (rule-based) expert systems, CBR systems can already be used with just some initial...
Thomas Roth-Berghofer
AI
2008
Springer
15 years 5 months ago
Analysing inconsistent first-order knowledgebases
It is well-known that knowledgebases may contain inconsistencies. We provide a framework of measures, based on a first-order four-valued logic, to quantify the inconsistency of a ...
John Grant, Anthony Hunter