Sciweavers

2783 search results - page 174 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
ACL
2012
13 years 4 months ago
Sentence Dependency Tagging in Online Question Answering Forums
Online forums are becoming a popular resource in the state of the art question answering (QA) systems. Because of its nature as an online community, it contains more updated knowl...
Zhonghua Qu, Yang Liu
PKC
2012
Springer
219views Cryptology» more  PKC 2012»
13 years 4 months ago
On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
We identify a potential weakness in the standard security model for dynamic group signatures which appears to have been overlooked previously. More specifically, we highlight tha...
Yusuke Sakai, Jacob C. N. Schuldt, Keita Emura, Go...
AAAI
2012
13 years 4 months ago
Discovering Constraints for Inductive Process Modeling
Scientists use two forms of knowledge in the construction of explanatory models: generalized entities and processes that relate them; and constraints that specify acceptable combi...
Ljupco Todorovski, Will Bridewell, Pat Langley
99
Voted
CICLING
2010
Springer
15 years 6 months ago
Extraction of Genic Interactions with the Recursive Logical Theory of an Ontology
We introduce an Information Extraction (IE) system which uses the logical theory of an ontology as a generalisation of the typical information extraction patterns to extract biolog...
Alain-Pierre Manine, Érick Alphonse, Philip...
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
15 years 6 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson