2:30 p.m. On the representation of band-limited signals using finitely many bits. Hrushikesh N Mhaskar*, California State University, Los Angeles
3:00 p.m. Triebel-Lizorkin spaces and $N$-term wavelet approximation. Guergana P Petrova*, University of Michigan
3:30 p.m. Kolmogorov and linear widths of weighted Sobolev-type classes on a finite interval. Dany Leviatan*, Univ. of South Carolina
Victor A Konovalov, National Academy of Sciences of Ukraine
4:00 p.m. Algorithms for Tree Approximations. Peter G Binev*, University of South Carolina
4:30 p.m. Interpolation by Polynomils on the plane and in higher dimensions. Boris Shekhtman*, University of South Florida
8:30 a.m. Worst case analysis of greedy algorithms in Banach spaces. Peter Oswald*, Bell Laboratories, Lucent Technologies
9:00 a.m. On Approximate $\ell_1$ Systems in Banach Spaces. Stephen J Dilworth, University of South Carolina
Denka N Kutzarova*, Bulgarian Academy of Sciences
Przemyslaw Wojtaszczyk, Warsaw University
9:30 a.m. Nonlinear ridge approximation and gridge algorithms. Konstantin I Oskolkov*, University of South Carolina
10:00 a.m. Approximate Weak Greedy Algorithms~: numerical motivations and sufficient condition of convergence. R\'emi Gribonval*, University of South Carolina.
Morten Nielsen, University of South Carolina.
10:30 a.m. Approximate Weak Greedy Algorithms~: detailed study of convergence. Morten Nielsen*, University of South Carolina.
R\'emi Gribonval, University of South Carolina.