210 search results - page 17 / 42 » Classical descriptive set theory as a refinement of effectiv... |
DOOD
1993
Springer
13 years 11 months ago
1993
Springer
In this paper we introduce a logical query language extended with object-oriented typing facilities. This language, called DTL (from DataTypeLog), can be seen as an extension of Da...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
es of circulant matrices. Our class is broader than just circulants, and we study patterned systems using abstract algebra, specifically the observation that a set of matrices with...
DEON
2006
Springer
13 years 11 months ago
2006
Springer
We aim at an adequate formal description of the dynamics of commitments and trust by transferring insights about actual human practices to a formal setting. Our framework is based ...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...