activity
20072023
most citedApproximation and learning by greedy algorithms

323 citations · 565 across the 31 of their papers we have counts for

collaborators
Showing 2014Show all

5 papers · 1 filter

math.ST2014★ 8 cited

Classification algorithms using adaptive partitioning

Peter Binev, Albert Cohen, Wolfgang Dahmen +1

Algorithms for binary classification based on adaptive tree partitioning are formulated and analyzed for both their risk performance and their friendliness to numerical implementat…

math.NA2014

Efficient Resolution of Anisotropic Structures

Wolfgang Dahmen, Chunyan Huang, Gitta Kutyniok +3

We highlight some recent new delevelopments concerning the sparse representation of possibly high-dimensional functions exhibiting strong anisotropic features and low regularity in…

math.NA2014★ 1 cited

Tensor-Sparsity of Solutions to High-Dimensional Elliptic Partial Differential Equations

Wolfgang Dahmen, Ronald DeVore, Lars Grasedyck +1

A recurring theme in attempts to break the curse of dimensionality in the numerical approximations of solutions to high-dimensional partial differential equations (PDEs) is to empl…

math.NA2014★ 1 cited

Adaptive Low-Rank Methods: Problems on Sobolev Spaces

Markus Bachmayr, Wolfgang Dahmen

This paper is concerned with the development and analysis of an iterative solver for high-dimensional second-order elliptic problems based on subspace-based low-rank tensor formats…

cs.CV2014★ 80 cited

Optimized imaging using non-rigid registration

Benjamin Berkels, Peter Binev, Douglas A. Blom +3

The extraordinary improvements of modern imaging devices offer access to data with unprecedented information content. However, widely used image processing methodologies fall far s…