We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
Angela del Pozo, Florencio Pazos, Alfonso Valencia
—In this paper, we study the capacity-achieving input covariance matrices for the jointly-correlated (or the Weichselberger) Rician fading multiple-input multiple-output (MIMO) a...
Chao-Kai Wen, Shi Jin, Kai-Kit Wong, Jung-Chieh Ch...
The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...
Background: Gene Ontology (GO) terms are often used to assess the results of microarray experiments. The most common way to do this is to perform Fisher's exact tests to find...