Sciweavers

370 search results - page 20 / 74
» Bounded modified realizability
Sort
View
ML
2002
ACM
145views Machine Learning» more  ML 2002»
13 years 8 months ago
Boosting Methods for Regression
In this paper we examine ensemble methods for regression that leverage or "boost" base regressors by iteratively calling them on modified samples. The most successful lev...
Nigel Duffy, David P. Helmbold
CISS
2008
IEEE
14 years 3 months ago
On optimal training and beamforming in uncorrelated MIMO systems with feedback
—This paper studies the design and analysis of optimal training-based beamforming in uncorrelated multipleinput multiple-output (MIMO) channels with known Gaussian statistics. Fi...
Francisco Rubio, Dongning Guo, Michael L. Honig, X...
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
11 years 11 months ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
ALENEX
2008
133views Algorithms» more  ALENEX 2008»
13 years 10 months ago
Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem
The multi-period newsvendor problem describes the dilemma of a newspaper salesman--how many paper should he purchase each day to resell, when he doesn't know the demand? We d...
Shawn O'Neil, Amitabh Chaudhary
IJCGA
2006
81views more  IJCGA 2006»
13 years 8 months ago
Discrete Laplace-Beltrami Operator on Sphere and Optimal Spherical Triangulations
In this paper we first modify a widely used discrete Laplace Beltrami operator proposed by Meyer et al over triangular surfaces, and then establish some convergence results for th...
Guoliang Xu