BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20121115T180000Z
DTEND:20121115T183000Z
LOCATION:255-EF
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: The n-point correlation functions (npcf) are powerful statistics that are widely used for data analyses in astronomy and other fields. These statistics have played a crucial role in fundamental physical breakthroughs, including the discovery of dark energy.  Unfortunately, directly computing the npcf at a single value requires $\bigO{N^n}$ time for $N$ points and values of $n$ of 2, 3, 4, or even larger. =0AAstronomical data sets can contain billions of points, and the next generation of surveys will generate terabytes of data per night. To meet these computational demands, we present a highly-tuned npcf computation code that show an order-of-magnitude speedup over current state-of-the-art.  This enables a much larger 3-point correlation computation on the galaxy distribution than was previously possible.  =0AWe show a detailed performance evaluation on many different architectures.
SUMMARY:Optimizing the Computation of N-Point Correlations on Large-Scale Astronomical Data
PRIORITY:3
END:VEVENT
END:VCALENDAR