We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
—It has been shown that the radio channel impulse response for a pair of legitimate Ultra-wide band (UWB) transceivers can be used to generate secret keys for secure communicatio...
Masoud Ghoreishi Madiseh, Michael L. McGuire, Step...
This paper presents a new variant of the classical Iterative Closest Point (ICP) algorithm. The ICP result depends heavily on the matching between 3D points of the two cloud of po...
Abstract. This paper illustrates how the Quadratic Assignment Problem (QAP) is used as a mathematical model that helps to produce a visualization of microarray data, based on the r...
Mario Inostroza-Ponta, Alexandre Mendes, Regina Be...
We present an efficient colon flattening algorithm using conformal structure, which is angle-preserving and minimizes the global distortion. Moreover, our algorithm is general w...