An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
Arithmetic coding achieves a superior coding rate when encoding a binary source, but its lack of speed makes it an inferior choice when true high? performance encoding is needed. ...
Joshua G. Senecal, Mark A. Duchaineau, Kenneth I. ...
— In this paper1 we address the problem of processing continuous multi-join queries, over distributed data streams. Our approach makes use of existing work in the field of publi...
Oana Jurca, Sebastian Michel, Alexandre Herrmann, ...
Distributed systems increasingly span organizational boundaries and, with this, system and service management domains. Web services are the primary means of exposing services to c...
Bruno Wassermann, Heiko Ludwig, Jim Laredo, Kamal ...
In numerous application areas fast growing data sets develop with ever higher complexity and dynamics. A central challenge is to filter the substantial information and to communic...
Daniel A. Keim, Florian Mansmann, Daniela Oelke, H...