Skip to content. | Skip to navigation

Personal tools

Navigation

You are here: Home / Meetings / All Meetings / Digging Deeper and Faster: Algorithms for Computationally Limited Problems in Time Domain Astronomy

Digging Deeper and Faster: Algorithms for Computationally Limited Problems in Time Domain 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. This workshop is a part of the Keck Institute for Space Studies program on "Digging Deeper: Algorithms for Computationally-Limited Searches in Astronomy". Our goal is to review some of the work done to date, and focus on some of the outstanding issues for the future studies. The workshop is open to anyone interested, and there is no registration fee. However, a registration is mandatory, for the logistical purposes, as the venue size is limited. Please register at http://www.astro.caltech.edu/digging/ . The (evolving) program and further details will be posted on that website.
When 12 December 2011 08:30 AM to
13 December 2011 08:30 AM
Where Caltech, Pasadena CA
Add event to calendar vCal
iCal

More information about this event…