Sciweavers

2095 search results - page 6 / 419
» Improved pebbling bounds
Sort
View
JMLR
2008
104views more  JMLR 2008»
13 years 7 months ago
Nearly Uniform Validation Improves Compression-Based Error Bounds
This paper develops bounds on out-of-sample error rates for support vector machines (SVMs). The bounds are based on the numbers of support vectors in the SVMs rather than on VC di...
Eric Bax
TEC
2012
197views Formal Methods» more  TEC 2012»
11 years 9 months ago
Improving Generalization Performance in Co-Evolutionary Learning
Recently, the generalization framework in co-evolutionary learning has been theoretically formulated and demonstrated in the context of game-playing. Generalization performance of...
Siang Yew Chong, Peter Tino, Day Chyi Ku, Xin Yao
WIOPT
2011
IEEE
12 years 11 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...
FFA
2010
139views more  FFA 2010»
13 years 6 months ago
Coset bounds for algebraic geometric codes
We develop new coset bounds for algebraic geometric codes. The bounds have a natural interpretation as an adversary threshold for algebraic geometric secret sharing schemes and le...
Iwan M. Duursma, Seungkook Park
TIT
2008
86views more  TIT 2008»
13 years 7 months ago
An Improved Outer Bound for Multiterminal Source Coding
We prove a new outer bound on the rate
Aaron B. Wagner, Venkat Anantharam