9405 search results - page 267 / 1881 » Computing a Model of Set Theory |
164
click to vote
NIPS
2000
15 years 5 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
141
click to vote
CODES
2007
IEEE
15 years 11 months ago
2007
IEEE
The design and analysis of today’s complex real-time systems requires advanced methods. Due to ever growing functionality, hardware complexity and component interaction, applyin...
153
click to vote
APSEC
1996
IEEE
15 years 8 months ago
1996
IEEE
Explosive increase in end-user computing on distributed systems requires that end-users develop application software by themselves. One solution is given as aformula of "adom...
122
click to vote
CIE
2010
Springer
15 years 8 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...
158
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...