Abstract: We present CLIPPER+, an algorithm for finding maximal cliques in unweighted graphs for outlier-robust global registration. The registration problem can be formulated as a graph and solved by ...

MaxCut is a key NP-hard combinatorial optimization problem. Quantum computing offers methods to solve such problems potentially better than classical counterparts, with the Quantum Approximate ...

The National Research Council of Canada (NRC)'s Applied Quantum Computing Challenge program is launching a call for proposals to support research in quantum ...

Abstract: Network Function Virtualization (NFV) has the potential for cost-efficiency, manage-convenience, and flexibility services but meanwhile poses challenges for the service function chain (SFC) ...

For a function \(H : {a| 0 \le a \le 2^n - 1} \rightarrow {b| 0 \le b \le 2^m - 1}\), the r-element distinctness problem is to find r-distinct elements \(a_1, a_2 ...

Accurate target detection and association are vital for the development of reliable target tracking, especially for cell tracking based on microscopy images due to the similarity of cells. We propose ...

Studying the impact of genetic variation on gene regulatory networks is essential to understand the biological mechanisms by which genetic variation causes variation in phenotypes. Bayesian networks ...

A large number of sparse signal reconstruction algorithms have been continuously proposed, but almost all greedy algorithms add a fixed number of indices to the support set in each iteration. Although ...

There are currently more than 100,000 patients on the waiting list in the United States for a kidney transplant from a deceased donor. To address this shortage, kidney exchange programs allow patients ...

In the continuing arms race in computer and network security, a common trend is that attackers are employing polymorphic techniques. Toolkits such as ADMmutate [17], PHATBOT [10], and CLET [5] are ...