Digging Deeper: Algorithms for Computationally-Limited Searches in Astronomy - Part II
December 12-15, 2011
This workshop is a conclusion of the Keck Institute for Space Studies program on "Digging Deeper: Algorithms for Computationally-Limited Searches in Astronomy."
There are many areas of astronomy where the sensitivity of searches for some types of signals is computationally limited, and either faster computers or better algorithms would lead to more discoveries in the same massive data sets or data streams. Examples include gravitational-wave data analysis, or the rapidly developing field of synoptic sky surveys, where transient signals from a variety of interesting astrophysical phenomena must be detected and characterized in (near) real-time.
During the initial workshop in June 2011, we have focused on 3 specific challenges:
Our goal for the closing workshop is to review some of the work done to date, and focus on some of the outstanding issues for the future studies.
The initial part of this workshop (Dec. 12-13) is open to anyone interested, and is described on www.astro.caltech.edu/digging (registration required). The subsequent portion of the workshop (Dec. 14-15) is for the core group members only (if you have been invited in June, you are a core group member).
Study Co-Lead George Djorgovski from Caltech.
Study Co-Lead Curt Cutler from JPL.
Study Co-Lead Bruce Elmegreen from IBM.