Sciweavers

106 search results - page 17 / 22
» The Laguerre-Sobolev-type orthogonal polynomials
Sort
View
NIPS
2008
13 years 8 months ago
Near-minimax recursive density estimation on the binary hypercube
This paper describes a recursive estimation procedure for multivariate binary densities using orthogonal expansions. For d covariates, there are 2d basis coefficients to estimate,...
Maxim Raginsky, Svetlana Lazebnik, Rebecca Willett...
CPHYSICS
2006
103views more  CPHYSICS 2006»
13 years 7 months ago
A band factorization technique for transition matrix element asymptotics
A new method of evaluating transition matrix elements between wave functions associated with orthogonal polynomials is proposed. The technique relies on purely algebraic manipulat...
Emmanuel Perrey-Debain, I. David Abrahams
ECCC
2007
96views more  ECCC 2007»
13 years 7 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky
TNN
2008
93views more  TNN 2008»
13 years 7 months ago
Towards the Optimal Design of Numerical Experiments
This paper addresses the problem of the optimal design of numerical experiments for the construction of nonlinear surrogate models. We describe a new method, called learner disagre...
S. Gazut, J.-M. Martinez, Gérard Dreyfus, Y...
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
13 years 7 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin