Sciweavers

7289 search results - page 332 / 1458
» A Dependent Set Theory
Sort
View
COLING
2008
15 years 8 months ago
Using Discourse Commitments to Recognize Textual Entailment
In this paper, we introduce a new framework for recognizing textual entailment (RTE) which depends on extraction of the set of publicly-held beliefs
Andrew Hickl
IJCNN
2007
IEEE
16 years 1 months ago
Character Recognition using Spiking Neural Networks
— A spiking neural network model is used to identify characters in a character set. The network is a two layered structure consisting of integrate-and-fire and active dendrite n...
Ankur Gupta, Lyle N. Long
ANTS
2006
Springer
139views Algorithms» more  ANTS 2006»
15 years 10 months ago
Hard Instances of the Constrained Discrete Logarithm Problem
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
Ilya Mironov, Anton Mityagin, Kobbi Nissim
CORR
2002
Springer
122views Education» more  CORR 2002»
15 years 6 months ago
On alternative approach for verifiable secret sharing
The proposed approach works for any underlying secret sharing scheme. It is based on the concept of verification sets of participants, related to authorized set of participants. T...
Kamil Kulesza, Zbigniew Kotulski, Josef Pieprzyk
EMNLP
2010
15 years 4 months ago
Using Universal Linguistic Knowledge to Guide Grammar Induction
We present an approach to grammar induction that utilizes syntactic universals to improve dependency parsing across a range of languages. Our method uses a single set of manually-...
Tahira Naseem, Harr Chen, Regina Barzilay, Mark Jo...