Sciweavers

922 search results - page 103 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
MLG
2007
Springer
16 years 12 days ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
FUZZY
2004
Springer
170views Fuzzy Logic» more  FUZZY 2004»
15 years 11 months ago
Consistency Conditions for Fuzzy Choice Functions
The revealed preference is a central subject in classical consumer theory. Authors like Samuelson, Arrow, Richter, Sen, Uzawa and others have proposed an axiomatic setting of reve...
Irina Georgescu
COLT
1999
Springer
15 years 10 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
SIGGRAPH
1996
ACM
15 years 10 months ago
Consequences of Stratified Sampling in Graphics
Antialiased pixel values are often computed as the mean of N point samples. Using uniformly distributed random samples, the central limit theorem predicts a variance of the mean o...
Don P. Mitchell
TAPSOFT
1997
Springer
15 years 10 months ago
Traces of I/O-Automata in Isabelle/HOLCF
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
Olaf Müller, Tobias Nipkow