Sciweavers

388 search results - page 66 / 78
» Program Analysis Using Symbolic Ranges
Sort
View
71
Voted
POPL
2010
ACM
15 years 4 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak
BMCBI
2010
143views more  BMCBI 2010»
14 years 9 months ago
ETE: a python Environment for Tree Exploration
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
Jaime Huerta-Cepas, Joaquín Dopazo, Toni Ga...
ASPLOS
2012
ACM
13 years 5 months ago
A case for unlimited watchpoints
Numerous tools have been proposed to help developers fix software errors and inefficiencies. Widely-used techniques such as memory checking suffer from overheads that limit thei...
Joseph L. Greathouse, Hongyi Xin, Yixin Luo, Todd ...
BMCBI
2006
97views more  BMCBI 2006»
14 years 9 months ago
Goulphar: rapid access and expertise for standard two-color microarray normalization methods
Background: Raw data normalization is a critical step in microarray data analysis because it directly affects data interpretation. Most of the normalization methods currently used...
Sophie Lemoine, Florence Combes, Nicolas Servant, ...
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
15 years 3 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie