Sciweavers

1568 search results - page 171 / 314
» The problem of examination questions in algorithmics
Sort
View
AAAI
2010
15 years 7 months ago
How Incomplete Is Your Semantic Web Reasoner?
Conjunctive query answering is a key reasoning service for many ontology-based applications. In order to improve scalability, many Semantic Web query answering systems give up com...
Giorgos Stoilos, Bernardo Cuenca Grau, Ian Horrock...
LREC
2008
174views Education» more  LREC 2008»
15 years 7 months ago
UnsuParse: unsupervised Parsing with unsupervised Part of Speech Tagging
Based on simple methods such as observing word and part of speech tag co-occurrence and clustering, we generate syntactic parses of sentences in an entirely unsupervised and self-...
Christian Hänig, Stefan Bordag, Uwe Quasthoff
NIPS
2004
15 years 7 months ago
Experts in a Markov Decision Process
We consider an MDP setting in which the reward function is allowed to change during each time step of play (possibly in an adversarial manner), yet the dynamics remain fixed. Simi...
Eyal Even-Dar, Sham M. Kakade, Yishay Mansour
JALC
2008
72views more  JALC 2008»
15 years 6 months ago
Maximal Error-Detecting Capabilities of Formal Languages
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
Stavros Konstantinidis, Pedro V. Silva
EMNLP
2009
15 years 4 months ago
Reverse Engineering of Tree Kernel Feature Spaces
We present a framework to extract the most important features (tree fragments) from a Tree Kernel (TK) space according to their importance in the target kernelbased machine, e.g. ...
Daniele Pighin, Alessandro Moschitti