Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
—Distributed orthogonal space–time block codes (DOSTBCs) achieving full-diversity order and single-symbol maximum-likelihood (ML) decodability have been introduced recently by ...
The four-triangles longest-edge (4T-LE) partition of a triangle t is obtained by joining the midpoint of the longest edge of t to the opposite vertex and to the midpoints of the t...
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...