370 search results - page 19 / 74 » Bounded modified realizability |
JMLR
2012
11 years 11 months ago
2012
Contextual bandit learning is a reinforcement learning problem where the learner repeatedly receives a set of features (context), takes an action and receives a reward based on th...
ESSLLI
1999
Springer
14 years 26 days ago
1999
Springer
Abstract. In agglutinating languages, bound morphemes can indicate grammatical functions that are realized by words in languages like English. In this paper, a morphosyntactic gene...
FLAIRS
2008
13 years 11 months ago
2008
This paper describes the implementation of a system that automatically learns selectional restrictions for individual senses of polysemous verbs from subject-object relationships....
IPPS
2000
IEEE
14 years 29 days ago
2000
IEEE
All-to-all personalized exchange is one of the most dense collective communication patterns and occurs in many important parallel computing/networking applications. In this paper,...
DCG
2007
13 years 8 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...