We show that the perfect matching problem in general graphs is in Quasi-NC. That is, we give a deterministic parallel algorithm which runs in polylogarithmic time on quasi-polynomially many processors. The result is obtained by…
Wolong: A Backend Optimizer for Deep Learning Computation and Open PAI Chair: Jilong Xue This talk presents Wolong, a backend optimization system for accelerating deep learning computation on graphics processing units (GPUs). It automatically applies…
In an ideal world, there would be infinite computing resources. These resources would be free and sustainable, with no impact on the future of our planet. They would run services that would be accessible anytime…
As we are building smart energy infrastructure that includes various forms of hybrid energy resources including electric vehicles, solar, battery storage etc., it firstly requires data to be collected from these disparate energy sources and…
As algorithms reach ever more deeply into our daily lives, increasing concern that they be “fair” has resulted in an explosion of research in the theory and machine learning communities. This talk surveys key results…
I will present a new data compression algorithm that compresses human text more effectively than all current variants of PPM, CTW, DMC, LZ (Lempel-Ziv), LZMA, CSE and BWT. It uses a hierarchical non-parametric sequence model…
