1139 search results - page 94 / 228 » Bounded Ideation Theory |
NECO
2010
13 years 7 months ago
2010
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...
RSA
2011
13 years 4 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
ICASSP
2011
IEEE
2011
IEEE
Analysis of the security of linear blinding techniques from an information theoretical point of view
13 years 27 days ago
We propose a novel model to characterize the security of linear blinding techniques. The proposed model relates the security of blinding to the possibility of estimating the blind...
SIAMFM
2011
12 years 12 months ago
2011
We consider model-free pricing of digital options, which pay out if the underlying asset has crossed both upper and lower barriers. We make only weak assumptions about the underly...
AML
2011
13 years 4 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...