We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
Coordination languages have recently been attracting signi cant attention as a means of programming parallel and distributed systems. The approach of separating coordination from ...
We utilize the ensemble of trees framework, a tractable mixture over superexponential number of tree-structured distributions [1], to develop a new model for multivariate density ...
Abstract— Distributed stream-based applications, such as continuous query systems, have network scale and time characteristics that challenge traditional distributed query optimi...
Jeffrey Shneidman, Peter R. Pietzuch, Matt Welsh, ...