922 search results - page 8 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
98
Voted
CIE
2009
Springer
15 years 8 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
15 years 9 days 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...
132
click to vote
SPC
2005
Springer
15 years 7 months 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 ...
166
Voted
PAMI
2012
13 years 4 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...
106
click to vote
SAT
2004
Springer
15 years 7 months 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...