3946 search results - page 16 / 790 » The computational complexity of choice sets |
205
click to vote
CCA
2009
Springer
15 years 9 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...
119
click to vote
STACS
2007
Springer
15 years 10 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...
159
click to vote
ECCC
2011
14 years 11 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...
113
click to vote
MOR
2008
15 years 4 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...
151
click to vote
JMLR
2010
14 years 11 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...