article

In pursuit of parallelism (abstract)

Author:

Harry F. SmithAuthors Info & Claims

ACM SIGCSE Bulletin, Volume 26, Issue 1

Page 409

https://doi.org/10.1145/191033.191332

Published: 12 March 1994 Publication History

Abstract

No abstract available.

Index Terms

In pursuit of parallelism (abstract)
1. Social and professional topics
  1. Professional topics
    1. Computing education
      1. Model curricula
2. Theory of computation
  1. Models of computation
    1. Concurrency
      1. Parallel computing models

Recommendations

Gradient hard thresholding pursuit

Hard Thresholding Pursuit (HTP) is an iterative greedy selection procedure for finding sparse solutions of underdetermined linear systems. This method has been shown to have strong theoretical guarantee and impressive numerical performance. In this ...
Transformations techniques for extracting parallelism in non-uniform nested loops

Executing a program in parallel machines needs not only to find sufficient parallelism in a program, but it is also important that we minimize the synchronization and communication overheads in the parallelized program. This yields to improve the ...
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit

We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogonal Matching Pursuit (OMP) and Thresholding. While recovery by Basis Pursuit ...

Comments

Information & Contributors

Information

Published In

ACM SIGCSE Bulletin Volume 26, Issue 1

March 1994

410 pages

ISSN:0097-8418

DOI:10.1145/191033

Editor:
Daniel Joyce
Villanova Univ., Villanova, PA

Issue’s Table of Contents

SIGCSE '94: Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
March 1994
414 pages
ISBN:0897916468
DOI:10.1145/191029
Chairmen:
Robert Beck
Villanova Univ., Villanova, PA
,
Don Goelman
Villanova Univ., Villanova, PA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 March 1994

Published in SIGCSE Volume 26, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Index Terms

Recommendations

Gradient hard thresholding pursuit

Transformations techniques for extracting parallelism in non-uniform nested loops

Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations