Sciweavers

256 search results - page 23 / 52
» On a Generalized Notion of Mistake Bounds
Sort
View
POPL
2010
ACM
14 years 5 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
ALT
2006
Springer
14 years 4 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
ALT
2009
Springer
14 years 4 months ago
Pure Exploration in Multi-armed Bandits Problems
Abstract. We consider the framework of stochastic multi-armed bandit problems and study the possibilities and limitations of strategies that explore sequentially the arms. The stra...
Sébastien Bubeck, Rémi Munos, Gilles...
ICDT
2001
ACM
114views Database» more  ICDT 2001»
14 years 1 days ago
Subsumption for XML types
XML data is often used (validated, stored, queried, etc) with respect to di erent types. Understanding the relationship between these types can provide important information for ma...
Gabriel M. Kuper, Jérôme Siméo...
BSL
2000
153views more  BSL 2000»
13 years 7 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon