3353 search results - page 577 / 671 » Laver and set theory |
ALT
2000
Springer
15 years 2 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
127
click to vote
CIKM
1997
Springer
15 years 2 months ago
1997
Springer
The access patterns of the users of a web-site are traditionally analyzed in order to facilitate the user access to the site's information. In this study, however, a systemat...
CIE
2010
Springer
15 years 1 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
SIGIR
2010
ACM
15 years 1 months ago
2010
ACM
We investigate the problem of learning document classifiers in a multilingual setting, from collections where labels are only partially available. We address this problem in the ...
ATAL
2008
Springer
14 years 12 months ago
2008
Springer
A rational agent adopts (or changes) its goals when new information (beliefs) becomes available or its desires (e.g., tasks it is supposed to carry out) change. In conventional ap...