Sciweavers

9842 search results - page 52 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
JMLR
2010
143views more  JMLR 2010»
13 years 2 months ago
Rademacher Complexities and Bounding the Excess Risk in Active Learning
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
Vladimir Koltchinskii
SIGDIAL
2010
13 years 5 months ago
Representing Uncertainty about Complex User Goals in Statistical Dialogue Systems
We point out several problems in scalingup statistical approaches to spoken dialogue systems to enable them to deal with complex but natural user goals, such as disjunctive and ne...
Paul A. Crook, Oliver Lemon
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
CSR
2008
Springer
13 years 7 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
CORR
2002
Springer
93views Education» more  CORR 2002»
13 years 7 months ago
Modeling Complex Domains of Actions and Change
This paper studies the problem of modeling complex domains of actions and change within highlevel action description languages. We investigate two main issues of concern: (a) can ...
Antonis C. Kakas, Loizos Michael