Sciweavers

882 search results - page 33 / 177
» On self-embeddings of computable linear orderings
Sort
View
BMCBI
2006
103views more  BMCBI 2006»
14 years 10 months ago
Probe-level linear model fitting and mixture modeling results in high accuracy detection of differential gene expression
Background: The identification of differentially expressed genes (DEGs) from Affymetrix GeneChips arrays is currently done by first computing expression levels from the low-level ...
Sébastien Lemieux
ALENEX
2010
156views Algorithms» more  ALENEX 2010»
14 years 11 months ago
Tabulation Based 5-Universal Hashing and Linear Probing
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
Mikkel Thorup, Yin Zhang
ICCS
2009
Springer
15 years 4 months ago
A Second Order Adjoint Method to Targeted Observations
The role of the second order adjoint in targeting strategies is studied and analyzed. Most targeting strategies use the first order adjoint to identify regions where additional in...
Humberto C. Godinez, Dacian N. Daescu
CODES
2010
IEEE
14 years 7 months ago
Automatic parallelization of embedded software using hierarchical task graphs and integer linear programming
The last years have shown that there is no way to disregard the advantages provided by multiprocessor System-on-Chip (MPSoC) architectures in the embedded systems domain. Using mu...
Daniel Cordes, Peter Marwedel, Arindam Mallik
GD
2006
Springer
15 years 1 months ago
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
David R. Wood, Jan Arne Telle