The speakers discuss Netflix’s architecture for surviving extreme traffic spikes. They explain the mechanics of prioritized ...

Studying the epic journey of the iconic jumping plumber can lead to new insights in theoretical computer science—and may help ...

Abstract: In modern graphics processing units (GPUs), scientific computing workloads are memory-bound due to the everincreasing data size and the limited off-chip memory bandwidth. The problem still ...

Mt-KaHyPar is a shared-memory algorithm for partitioning graphs and hypergraphs. The balanced (hyper)graph partitioning problem asks for a partition of the node set of a (hyper)graph into k disjoint ...

cAustralian Red Cross Lifeblood Research and Development, Brisbane, Queensland, Australia dResearch and Development, Australian Red Cross Blood Service, Sydney, New South Wales, Australia eOffice of ...

The algorithm relies on the Kac-Ward formalism, a mathematical method that allows exact computation of partition functions for planar spin glass systems in polynomial time, making it possible to ...

Abstract: As the processing of large-scale graphs on a single device is infeasible without partitioning, graph partitioning algorithms are essential for various algorithms and distributed computing ...

Large language models have captured the news cycle, but there are many other kinds of machine learning and deep learning with many different use cases. Amid all the hype and hysteria about ChatGPT, ...

Fiber clustering methods are typically used in brain research to study the organization of white matter bundles from large diffusion MRI tractography datasets. These methods enable exploratory bundle ...