Sciweavers

428 search results - page 4 / 86
» Completeness of a Fact Extractor
Sort
View
TABLEAUX
2000
Springer
13 years 11 months ago
Benchmark Analysis with FaCT
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
Ian Horrocks
ICSM
2006
IEEE
14 years 1 months ago
Source-Level Linkage: Adding Semantic Information to C++ Fact-bases
Facts extracted from source code have been used to support a variety of software engineering activities, ranging from architectural understanding, through detection of design patt...
Daqing Hou, H. James Hoover
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 7 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
ICCSA
2004
Springer
14 years 24 days ago
Semantic Completeness in Sub-ontology Extraction Using Distributed Methods
The use of ontologies lies at the very heart of the newly emerging era of Semantic Web. They provide a shared conceptualization of some domain that may be communicated between peop...
Mehul Bhatt, Carlo Wouters, Andrew Flahive, J. Wen...
EUROCRYPT
2009
Springer
14 years 8 months ago
Key Agreement from Close Secrets over Unsecured Channels
We consider information-theoretic key agreement between two parties sharing somewhat different versions of a secret w that has relatively little entropy. Such key agreement, also ...
Bhavana Kanukurthi, Leonid Reyzin