Speaker:
Dr
Cristiano Sabiu
(University of Seoul)
- Estimating the General N-point Statistics
- Use tree-code to find all data points close to 1
- Do this for each data point
- Creating a huge database of pairs
- It's quite fast to create, but memory intensive
- Query for N-point
- All 'pairs' (w/ distances) are precomputed.
- N-point exact counting.
- I.e. No approximation
- The majority of the time is taken in binning in high-dimension.
- Create a graph-database
- Finding the disconnected distances
- (Distance, Unique ID)
- (14, 3675)
- (17, 620)
- (13, 342)
- Find distance(gal 1, gal 3675)
- (Distance, Unique ID)
- (13, 342)
- (17, 620)
- (14, 3675) → Bisecting
- Python 'where' is slow
- Fortran loops are ok, not optimized