922 search results - page 8 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
CIE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Intuitively, a recursion theorem asserts the existence of selfreferential programs. Two well-known recursion theorems are Kleene’s Recursion Theorem (krt) and Rogers’...
JSYML
2010
13 years 5 months ago
2010
Dp-minimality is a common generalization of weak minimality and weak o-minimality. If T is a weakly o-minimal theory then it is dp-minimal (Fact 2.2), but there are dp-minimal den...
SPC
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
PAMI
2012
11 years 9 months ago
2012
Abstract—We consider two desired properties of learning algorithms: sparsity and algorithmic stability. Both properties are believed to lead to good generalization ability. We sh...
SAT
2004
Springer
14 years 22 days ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...