Connexions

Sections
You are here: Home » Content » Greedy algorithms

About: Greedy algorithms

Module by: Chinmay Hegde. E-mail the author

View the content: Greedy algorithms

Metadata

Name: Greedy algorithms
ID: m37294
Language: English (en)
Summary: In this module we provide an overview of some of the most common greedy algorithms and their application to the problem of sparse recovery.
Subject: Mathematics and Statistics
Keywords: CoSaMP, Greedy algorithms, Matching pursuit, Orthogonal matching pursuit, Stagewise orthogonal matching pursuit
License: Creative Commons Attribution License CC-BY 3.0
Authors: Chinmay Hegde (ch3@rice.edu)
Copyright Holders: Chinmay Hegde (ch3@rice.edu)
Maintainers: Chinmay Hegde (ch3@rice.edu), Jared Adler (jca2@rice.edu), Daniel Williamson (dcwill@cnx.org), Mark A. Davenport (markad@stanford.edu)
Latest version: 1.4 (history)
First publication date: Mar 18, 2011 1:57 am -0500
Last revision to module: May 23, 2011 11:47 am -0500

Downloads

PDF: m37294_1.4.pdf PDF file, for viewing content offline and printing. Learn more.
EPUB: m37294_1.4.epub Electronic publication file, for viewing in handheld devices. Learn more.
XML: m37294_1.4.cnxml XML that defines the structure and contents of the module, minus any included media files. Can be reimported in the editing interface. Learn more.
Source Export ZIP: m37294_1.4.zip ZIP containing the module XML plus any included media files. Can be reimported in the editing interface. Learn more.

Version History

Version: 1.4 May 23, 2011 11:47 am -0500 by Jared Adler
Changes: 
proofreading fix
Version: 1.3 Apr 15, 2011 1:13 am -0500 by Mark A. Davenport
Changes: 
Added links.
Version: 1.2 Apr 10, 2011 12:19 am -0500 by Jared Adler
Changes: 
image fixes
Version: 1.1 Mar 28, 2011 9:47 pm -0500 by Mark A. Davenport
Changes: 
Initial publish.

How to Reuse and Attribute This Content

If you derive a copy of this content using a Connexions account and publish your version, proper attribution of the original work will be automatically done for you.

If you reuse this work elsewhere, in order to comply with the attribution requirements of the license (CC-BY 3.0), you must include

  • the authors' names: Chinmay Hegde
  • the title of the work: Greedy algorithms
  • the Connexions URL where the work can be found: http://cnx.org/content/m37294/1.4/

See the citation section below for examples you can copy.

How to Cite and Attribute This Content

The following citation styles comply with the attribution requirements for the license (CC-BY 3.0) of this work:

American Chemical Society (ACS) Style Guide:

Hegde, C. Greedy algorithms, Connexions Web site. http://cnx.org/content/m37294/1.4/, May 23, 2011.

American Medical Assocation (AMA) Manual of Style:

Hegde C. Greedy algorithms [Connexions Web site]. May 23, 2011. Available at: http://cnx.org/content/m37294/1.4/.

American Psychological Assocation (APA) Publication Manual:

Hegde, C. (2011, May 23). Greedy algorithms. Retrieved from the Connexions Web site: http://cnx.org/content/m37294/1.4/

Chicago Manual of Style (Bibliography):

Hegde, Chinmay. "Greedy algorithms." Connexions. May 23, 2011. http://cnx.org/content/m37294/1.4/.

Chicago Manual of Style (Note):

Chinmay Hegde, "Greedy algorithms," Connexions, May 23, 2011, http://cnx.org/content/m37294/1.4/.

Chicago Manual of Style (Reference, in Author-Date style):

Hegde, C. 2011. Greedy algorithms. Connexions, May 23, 2011. http://cnx.org/content/m37294/1.4/.

Modern Languages Association (MLA) Style Manual:

Hegde, Chinmay. Greedy algorithms. Connexions. 23 May 2011 <http://cnx.org/content/m37294/1.4/>.