Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
Trajectory clustering has played a crucial role in data analysis since it reveals underlying trends of moving objects. Due to their sequential nature, trajectory data are often rec...
Due to the development of high speed circuits beyond the 2-GHz mark, the significance of automatic test pattern generation for Path Delay Faults (PDFs) drastically increased in t...
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
Dionysios Logothetis, Christopher Olston, Benjamin...