Sciweavers

872 search results - page 62 / 175
» Extreme lower probabilities
Sort
View
100
Voted
NIPS
2003
15 years 1 months ago
Sparseness of Support Vector Machines---Some Asymptotically Sharp Bounds
The decision functions constructed by support vector machines (SVM’s) usually depend only on a subset of the training set—the so-called support vectors. We derive asymptotical...
Ingo Steinwart
101
Voted
NIPS
1998
15 years 1 months ago
Inference in Multilayer Networks via Large Deviation Bounds
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
Michael J. Kearns, Lawrence K. Saul
CORR
2008
Springer
58views Education» more  CORR 2008»
15 years 20 days ago
Tight Bounds on Minimum Maximum Pointwise Redundancy
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
Michael Baer
65
Voted
CORR
2007
Springer
91views Education» more  CORR 2007»
15 years 16 days ago
Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources
We propose an information–theoretic approach to the watermark embedding and detection under limited detector resources. First, we present asymptotically optimal decision regions...
Neri Merhav, Erez Sabbag
CORR
2011
Springer
172views Education» more  CORR 2011»
14 years 7 months ago
Possibilities and impossibilities in Kolmogorov complexity extraction
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
Marius Zimand