Sharing structured data today requires agreeing on a standard schema, then mapping and cleaning all of the data to achieve a single queriable mediated instance. However, for setti...
Todd J. Green, Grigoris Karvounarakis, Zachary G. ...
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of...
Steve Linton, G. Pfeiffer, Edmund F. Robertson, Ni...
We introduce variant types and a pattern matching operation to synchronous dataflow languages. These languages are used in the design of reactive systems. As these systems grow in...
Abstract. In this paper we elaborate on the challenges of learning manifolds that have many relevant clusters, and where the clusters can have widely varying statistics. We call su...
Collective operations on distributed data sets foster a high-level data-parallel programming style that eases many aspects of parallel programming significantly. In this paper we...