Sciweavers

349 search results - page 12 / 70
» Language Resources for Studying Argument
Sort
View
CRYPTO
2005
Springer
110views Cryptology» more  CRYPTO 2005»
14 years 28 days ago
Impossibility and Feasibility Results for Zero Knowledge with Public Keys
In this paper, we continue the study the round complexity of black-box zero knowledge in the bare public-key (BPK, for short) model previously started by Micali and Reyzin in [11]....
Joël Alwen, Giuseppe Persiano, Ivan Visconti
LREC
2010
156views Education» more  LREC 2010»
13 years 8 months ago
Propbank Instance Annotation Guidelines Using a Dedicated Editor, Jubilee
This paper gives guidelines of how to annotate Propbank instances using a dedicated editor, Jubilee. Propbank is a corpus in which the arguments of each verb predicate are annotat...
Jinho D. Choi, Claire Bonial, Martha Palmer
IGPL
2008
67views more  IGPL 2008»
13 years 7 months ago
Complete Axiomatisations of Properties of Finite Sets
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...
Thomas Ågotnes, Michal Walicki
EACL
2006
ACL Anthology
13 years 8 months ago
Making Tree Kernels Practical for Natural Language Learning
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...
Alessandro Moschitti
JVA
2006
IEEE
14 years 1 months ago
Describing and Researching of Learning Resources with Ontology Model
In this paper, we will introduce to describe learning resources by using ontology model based on metadata of learning standard as Sharable Content Object Reference Model (SCORM) a...
S. Niwattanakul, M. Eboueya, D. Lillis