Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be expressed as a conjunctive query over the relations in the set S? Our algorithm is derived by first introducing the concept of a plain basis for a co-clone and then identifying natural plain bases for every co-clone in Post's lattice. In the process, we also give a quadratic algorithm for the problem of finding the smallest co-clone containing a Boolean relation. © 2008 Elsevier Inc. All rights reserved.
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Naga Ayachitula, Melissa Buco, et al.
SCC 2007
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007