3353 search results - page 172 / 671 » Laver and set theory |
180
click to vote
JMLR
2010
15 years 1 months ago
2010
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...
198
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of ...
213
click to vote
JMLR
2012
13 years 9 months ago
2012
We study the prevalent problem when a test distribution differs from the training distribution. We consider a setting where our training set consists of a small number of sample d...
163
click to vote
ICNC
2005
Springer
15 years 12 months ago
2005
Springer
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem，and the solution can be reduced to determining the minimal co...
159
click to vote
WWW
2010
ACM
15 years 11 months ago
2010
ACM
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...