Addressing the challenges of extreme scale computing requires holistic design of new programming models and systems that support those models. This paper discusses the Angstrom pr...
Henry Hoffmann, Jim Holt, George Kurian, Eric Lau,...
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
To date, many active learning techniques have been developed for acquiring labels when training data is limited. However, an important aspect of the problem has often been neglect...
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...