2004 Industrial Mathematics Institute Research Reports

You can acquire a hard-copy of a report by downloading the postscript or pdf file (if available) or by sending your request via one of the following options. (Be sure to include your complete mailing address and the report number(s).)
04:01  L.A. Székely
Counting rooted spanning forests in complete multipartite graphs

04:02  P. Erdös, A. Seress and L.A. Székely
Non-trivial t-intersection in the function lattice

04:03  E. Czabarka, O. Sýkora, L.A. Székely and I.Vrt'o
Outerplanar crossing numbers, circular arrangement problem, and isoparametric functions

04:04  L.A. Székely and H. Wang
On subtrees of trees

04:05  S. Konyagin and V.N. Temlyakov
Some error estimates in learning theory

04:06  D.L. Donoho, M. Elad and V. Temlyakov
Stable recovery of sparse overcomplete representations in the presence of noise

04:07  W. Dahmen and P. Petrushev
"Push-the-Error" algorithm for nonlinear n-term approximation

04:08  A.S. Fokas, A. Its and L.-Y. Sung
The nonlinear Schrödinger equation on the half-line

04:09  S.V. Konyagin and V.N. Temlyakov
The entropy in the learning theory. Error estimates

04:10  R. DeVore, G. Kerkyacharian, D. Picard and V.Temlyakov
On mathematical methods of learning

04:11  S.C. Brenner and L.-Y. Sung
Multigrid algorithms for C0 interior penalty methods

04:12  R.C. Sharpley and V. Vatchev
Analysis of the intrinsic mode functions

04:13  R.B. Kellogg and M. Stynes
A singularly perturbed convection-diffusion problem in a half-plane

04:14   S.V. Konyagin and V.N. Temlyakov
Convergence of greedy algorithms for the trigonometric system

04:15  S.C. Brenner and K. Wang
Two-level additive Schwarz preconditioners for C0 interior penalty methods

04:16  G. Kyriazis, K. Park and P. Petrushev
Anisotropic Franklin bases on polygonal domains

04:17  G. Kyriazis and P. Petrushev
On the construction of frames on Triebel-Lizorkin and Besov spaces

04:18  K. Park
Bivariate n-term rational approximation

04:19  P. Binev, W. Dahmen, R. DeVore and N. Dyn
Adaptive approximation of curves

04:20  P. Binev, A. Cohen, W. Dahmen, R. DeVore and V. Temlyakov
Universal algorithms for learning theory Part I: piecewise constant functions

04:21  S.C. Brenner and J. Zhao
Convergence of multigrid algorithms for interior penalty methods

04:22   R. DeVore, G. Kerkyacharian, D. Picard and V. Temlyakov
Mathematical methods for supervised learning

04:23   V. Temlyakov
Optimal estimators in learning theory

04:24   J.R. Griggs and X.T. Jin
Real number graph labelings with distance conditions

04:25   J.R. Griggs and X.T. Jin
Optimal channel assignments for lattices with conditions at distance two

04:26   X.T. Jin and R.K. Yeh
Graph distance-dependent labeling related to code assignment in computer networks (pdf file)

04:27   V.N. Temlyakov
On greedy algorithms with restricted depth search

[ IMI Research Reports | IMI Home Page]

Last modified December 22, 2004 by Susanne C. Brenner

Send comments to imip@math.sc.edu