◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Davenport

44 papers hereh-index 3612.5k citations132 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author10
  • middle author18
  • last author16

Across the 44 of 44 papers where every author was matched, so the position is known.

fields
  • cs.IT10
  • stat.ML9
  • cs.LG7
  • eess.SP7
  • math.NA4
  • math.ST3
same name
  • M. Davenport — 46 papers, h 43
  • M. Davenport — 12 papers
  • M. Davenport — 7 papers, h 4
  • M. Davenport — 2 papers, h 2
  • M. Davenport — 1 paper, h 31
  • M. Davenport — 1 paper, h 0

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20092023
most citedAn overview of low-rank matrix recovery from incomplete observations

458 citations · 893 across the 37 of their papers we have counts for

collaborators
Showing math.NAShow all

4 papers · 1 filter

math.NA2016

The Fast Slepian Transform

Santhosh Karnik, Zhihui Zhu, Michael B. Wakin +2

The discrete prolate spheroidal sequences (DPSS's) provide an efficient representation for discrete signals that are perfectly timelimited and nearly bandlimited. Due to the high c…

math.NA2011★ 2 cited

On the stability and accuracy of least squares approximations

Albert Cohen, Mark A. Davenport, Dany Leviatan

We consider the problem of reconstructing an unknown function f on a domain X from samples of f at n randomly chosen points with respect to a given measure ρX​. Given a s…

math.NA2009★ 48 cited

A simple proof that random matrices are democratic

Mark A. Davenport, Jason N. Laska, Petros T. Boufounos +1

The recently introduced theory of compressive sensing (CS) enables the reconstruction of sparse or compressible signals from a small set of nonadaptive, linear measurements. If pro…

math.NA2009

Analysis of Orthogonal Matching Pursuit using the Restricted Isometry Property

Mark A. Davenport, Michael B. Wakin

Orthogonal Matching Pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.