Given a large graph, the authors we aim at producing a concise lossy representation (a summary) that can be stored in main memory and used to approximately answer queries about the original graph much faster than by using the exact representation.
The authors investigate the interrelationships between macro-systems of governments and financial institutions by studying the dynamic propagation mechanisms of macroeconomic shocks.
The authors lay out the fundamental concepts behind OCR--a new runtime system designed to meet the needs of extreme-scale computing--and compare OCR performance to that from MPI for two simple benchmarks.
The author introduces Huohua, Two Sigma’s implementation of highly optimized time series operations in Spark.
The authors present an algorithm to help detect new information and events in a network by computing an optimal probing schedule that minimizes the average novelty of undetected items.
The author introduces Cook, an advanced fair-sharing, preemptive scheduling backend for Spark.