D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 39 Citations 20,523 99 World Ranking 4774 National Ranking 2362

Research.com Recognitions

Awards & Achievements

2006 - Fellow of Alfred P. Sloan Foundation

Overview

What is she best known for?

The fields of study she is best known for:

  • Algorithm
  • Statistics
  • Artificial intelligence

Her primary scientific interests are in Algorithm, Sparse approximation, Representation, Polynomial and Compressed sensing. Her Algorithm study often links to related topics such as Linear combination. The concepts of her Sparse approximation study are interwoven with issues in Adjacency matrix, Matching pursuit, Sparse matrix and Greedy algorithm.

The Matching pursuit study which covers Mathematical optimization that intersects with Basis pursuit denoising. Anna C. Gilbert has included themes like Discrete-time signal, Fourier transform and Signal in her Polynomial study. Her research integrates issues of Data stream, Algorithm design and Signal reconstruction, Signal processing in her study of Compressed sensing.

Her most cited work include:

  • Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit (7158 citations)
  • Algorithms for simultaneous sparse approximation: part I: Greedy pursuit (1100 citations)
  • Dynamics of IP traffic: a study of the role of variability and the impact of control (394 citations)

What are the main themes of her work throughout her whole career to date?

Her scientific interests lie mostly in Algorithm, Compressed sensing, Sparse approximation, Combinatorics and Theoretical computer science. Her biological study focuses on Matching pursuit. Her work in the fields of Matching pursuit, such as Basis pursuit, overlaps with other areas such as Convex optimization.

Her Compressed sensing study also includes fields such as

  • Signal reconstruction which intersects with area such as Mathematical optimization,
  • Group testing which is related to area like Decoding methods,
  • Wireless sensor network that intertwine with fields like Structural health monitoring and Real-time computing. Her Sparse approximation study necessitates a more in-depth grasp of Artificial intelligence. Her Combinatorics study combines topics from a wide range of disciplines, such as Discrete mathematics, Upper and lower bounds and Distribution.

She most often published in these fields:

  • Algorithm (30.57%)
  • Compressed sensing (18.47%)
  • Sparse approximation (14.65%)

What were the highlights of her more recent work (between 2017-2020)?

  • Algorithm (30.57%)
  • Discrete mathematics (10.83%)
  • Metric (5.10%)

In recent papers she was focusing on the following fields of study:

The scientist’s investigation covers issues in Algorithm, Discrete mathematics, Metric, Feature and Differential privacy. Her Algorithm research focuses on Synthetic data in particular. The study incorporates disciplines such as Fast Fourier transform, Legendre polynomials, Discrete Fourier transform, Jacobi polynomials and Classical orthogonal polynomials in addition to Discrete mathematics.

Her research in Metric intersects with topics in Embedding, Tree structure, Key and Orders of magnitude. Her Feature research includes elements of Ranking, Pairwise comparison and Information retrieval. Her Differential privacy research incorporates elements of Property testing and Theoretical computer science.

Between 2017 and 2020, her most popular works were:

  • But How Does It Work in Theory? Linear SVM with Random Features (27 citations)
  • On the Approximation Properties of Random ReLU Features (15 citations)
  • Property Testing for Differential Privacy (7 citations)

In her most recent research, the most cited papers focused on:

  • Algorithm
  • Statistics
  • Artificial intelligence

Anna C. Gilbert mainly focuses on Reproducing kernel Hilbert space, Bounded function, Algorithm, Mutual fund separation theorem and Artificial neural network. Her Reproducing kernel Hilbert space investigation overlaps with Fourier transform, Universality theorem, Of the form, Function and Feature. Anna C. Gilbert integrates Universality theorem with Applied mathematics in her study.

Her research in the fields of Synthetic data overlaps with other disciplines such as Work.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

J.A. Tropp;A.C. Gilbert.
IEEE Transactions on Information Theory (2007)

9982 Citations

Algorithms for simultaneous sparse approximation: part I: Greedy pursuit

Joel A. Tropp;Anna C. Gilbert;Martin J. Strauss.
Signal Processing (2006)

1381 Citations

Data networks as cascades: investigating the multifractal nature of Internet WAN traffic

A. Feldmann;A. C. Gilbert;W. Willinger.
acm special interest group on data communication (1998)

751 Citations

Dynamics of IP traffic: a study of the role of variability and the impact of control

Anja Feldmann;Anna C. Gilbert;Polly Huang;Walter Willinger.
acm special interest group on data communication (1999)

652 Citations

Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries

Anna C. Gilbert;Yannis Kotidis;S. Muthukrishnan;Martin Strauss.
very large data bases (2001)

567 Citations

The changing nature of network traffic: scaling phenomena

A. Feldmann;A. C. Gilbert;W. Willinger;T. G. Kurtz.
acm special interest group on data communication (1998)

505 Citations

Combining geometry and combinatorics: A unified approach to sparse signal recovery

R. Berinde;A.C. Gilbert;P. Indyk;H. Karloff.
allerton conference on communication, control, and computing (2008)

374 Citations

Sparse Recovery Using Sparse Matrices

Anna Gilbert;Piotr Indyk.
Proceedings of the IEEE (2010)

364 Citations

Fast, small-space algorithms for approximate histogram maintenance

Anna C. Gilbert;Sudipto Guha;Piotr Indyk;Yannis Kotidis.
symposium on the theory of computing (2002)

356 Citations

One sketch for all: fast algorithms for compressed sensing

A. C. Gilbert;M. J. Strauss;J. A. Tropp;R. Vershynin.
symposium on the theory of computing (2007)

353 Citations

Best Scientists Citing Anna C. Gilbert

Richard G. Baraniuk

Richard G. Baraniuk

Rice University

Publications: 79

Yonina C. Eldar

Yonina C. Eldar

Weizmann Institute of Science

Publications: 62

Piotr Indyk

Piotr Indyk

MIT

Publications: 62

Trac D. Tran

Trac D. Tran

Johns Hopkins University

Publications: 58

Moeness G. Amin

Moeness G. Amin

Villanova University

Publications: 56

Yimin Zhang

Yimin Zhang

Temple University

Publications: 49

Graham Cormode

Graham Cormode

University of Warwick

Publications: 47

Michael B. Wakin

Michael B. Wakin

Colorado School of Mines

Publications: 46

David P. Woodruff

David P. Woodruff

Carnegie Mellon University

Publications: 42

Minos Garofalakis

Minos Garofalakis

Technical University of Crete

Publications: 41

Volkan Cevher

Volkan Cevher

École Polytechnique Fédérale de Lausanne

Publications: 39

Byonghyo Shim

Byonghyo Shim

Seoul National University

Publications: 37

Yehia Massoud

Yehia Massoud

Stevens Institute of Technology

Publications: 37

Marco F. Duarte

Marco F. Duarte

University of Massachusetts Amherst

Publications: 34

Holger Rauhut

Holger Rauhut

RWTH Aachen University

Publications: 33

Licheng Jiao

Licheng Jiao

Xidian University

Publications: 33

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us
Something went wrong. Please try again later.