Sciweavers

209 search results - page 11 / 42
» Monte Carlo Go Has a Way to Go
Sort
View
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
14 years 7 months ago
A nearly optimal oracle for avoiding failed vertices and edges
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...
Aaron Bernstein, David R. Karger
BMCBI
2008
200views more  BMCBI 2008»
13 years 6 months ago
Defining functional distances over Gene Ontology
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
ICASSP
2011
IEEE
12 years 10 months ago
On the ergodic capacity of jointly-correlated rician Fading MIMO channels
—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...
HPCC
2010
Springer
13 years 6 months ago
A Generic Algorithm Template for Divide-and-Conquer in Multicore Systems
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...
Carlos H. Gonzalez, Basilio B. Fraguela
BMCBI
2006
147views more  BMCBI 2006»
13 years 6 months ago
Grouping Gene Ontology terms to improve the assessment of gene set enrichment in microarray data
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...
Alex Lewin, Ian C. Grieve