3946 search results - page 16 / 790 » The computational complexity of choice sets |
CCA
2009
Springer
14 years 2 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
STACS
2007
Springer
14 years 3 months ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
ECCC
2011
13 years 4 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
MOR
2008
13 years 9 months ago
2008
Abstract: This paper defines the extensive form correlated equilibrium (EFCE) for extensive games with perfect recall. The EFCE concept extends Aumann's strategic-form correla...
JMLR
2010
13 years 4 months ago
2010
In this paper we integrate two essential processes, discretization of continuous data and learning of a model that explains them, towards fully computational machine learning from...