Sciweavers

1395 search results - page 93 / 279
» Modeling betweenness for question answering
Sort
View
CSR
2009
Springer
15 years 7 months ago
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
Olaf Beyersdorff, Zenon Sadowski
MST
2006
100views more  MST 2006»
15 years 4 months ago
On Delivery Times in Packet Networks under Adversarial Traffic
We consider packet networks and make use of the adversarial queuing theory" model 10 . We are interested in the question of guaranteeing that all packets are actually deliver...
Adi Rosén, Michael S. Tsirkin
ACL
2012
13 years 6 months ago
Computational Approaches to Sentence Completion
This paper studies the problem of sentencelevel semantic coherence by answering SATstyle sentence completion questions. These questions test the ability of algorithms to distingui...
Geoffrey Zweig, John C. Platt, Christopher Meek, C...
LREC
2010
213views Education» more  LREC 2010»
15 years 5 months ago
Extensive Evaluation of a FrameNet-WordNet mapping resource
Lexical resources are basic components of many text processing system devoted to information extraction, question answering or dialogue. In paste years many resources have been de...
Diego De Cao, Danilo Croce, Roberto Basili
ECEASST
2008
60views more  ECEASST 2008»
15 years 4 months ago
Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...
Leen Lambers, Hartmut Ehrig, Gabriele Taentzer