The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
Large-scale distributed systems provide an attractive scalable infrastructure for network applications. However, the loosely-coupled nature of this environment can make data acces...
Many storage systems rely on replication to increase the availability and durability of data on untrusted storage systems. At present, such storage systems provide no strong evide...
Reza Curtmola, Osama Khan, Randal C. Burns, Giusep...
This paper proposes a new single-frame image upconversion approach that uses prior information. The proposed method overcomes the drawbacks of the Kondo 2001 where the class membe...
—The rapid burgeoning of available protein data makes the use of clustering within families of proteins increasingly important, the challenge is to identify subfamilies of evolut...
Abdellali Kelil, Shengrui Wang, Ryszard Brzezinski