Sciweavers

125 search results - page 2 / 25
» N Semantic Classes are Harder than Two
Sort
View
KR
2000
Springer
14 years 1 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
FSE
2003
Springer
115views Cryptology» more  FSE 2003»
14 years 3 months ago
OMAC: One-Key CBC MAC
In this paper, we present One-key CBC MAC (OMAC) and prove its security for arbitrary length messages. OMAC takes only one key, K (k bits) of a block cipher E. Previously, XCBC req...
Tetsu Iwata, Kaoru Kurosawa
TSD
2007
Springer
14 years 3 months ago
Inducing Classes of Terms from Text
This paper describes a clustering method for organizing in semantic classes a list of terms. The experiments were made using a POS annotated corpus, the ACL Anthology, which consis...
Pablo Gamallo, Gabriel Pereira Lopes, Alexandre Ag...
OWLED
2007
13 years 11 months ago
SPARQL-DL: SPARQL Query for OWL-DL
There are many query languages (QLs) that can be used to query RDF and OWL ontologies but neither type is satisfactory for querying OWL-DL ontologies. RDF-based QLs (RDQL, SeRQL, S...
Evren Sirin, Bijan Parsia
JMLR
2006
109views more  JMLR 2006»
13 years 9 months ago
Some Discriminant-Based PAC Algorithms
A classical approach in multi-class pattern classification is the following. Estimate probability distributions that generated the observations for each label class, and then labe...
Paul W. Goldberg