Sciweavers

5158 search results - page 198 / 1032
» Generalization of the Dempster-Shafer Theory
Sort
View
NECO
2010
97views more  NECO 2010»
15 years 4 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 9 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich

Lecture Notes
516views
17 years 5 months ago
Financial Economics
These notes cover several topics such as The classic capital asset pricing model, The CAPM in general equilibrium, Infinite horizon economies, Continuous time models, Asset pricing...
Antonio Mele
LATA
2009
Springer
16 years 1 months ago
A Series of Run-Rich Strings
We present a new series of run-rich strings, and give a new lower bound 0.94457567 of the maximum number of runs in a string. We also introduce the general conjecture about a asymp...
Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, A...
CDC
2008
IEEE
16 years 1 months ago
Proportional-Integral Observer design for nonlinear systems
— A new dissipative method to design observers for a large class of nonlinear systems has been introduced recently by the author. It generalizes and includes several wellknown ob...
Jaime A. Moreno