Sciweavers

43 search results - page 8 / 9
» A Dynamic Programming Approach for Finding Common Patterns i...
Sort
View
LCPC
1997
Springer
13 years 11 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
BMCBI
2008
259views more  BMCBI 2008»
13 years 7 months ago
DISCLOSE : DISsection of CLusters Obtained by SEries of transcriptome data using functional annotations and putative transcripti
Background: A typical step in the analysis of gene expression data is the determination of clusters of genes that exhibit similar expression patterns. Researchers are confronted w...
Evert-Jan Blom, Sacha A. F. T. van Hijum, Klaas J....
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 9 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
PDPTA
2000
13 years 8 months ago
Evaluation of Neural and Genetic Algorithms for Synthesizing Parallel Storage Schemes
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
Mayez A. Al-Mouhamed, Husam Abu-Haimed
UM
2009
Springer
14 years 2 months ago
PerspectiveSpace: Opinion Modeling with Dimensionality Reduction
Abstract. Words mean different things to different people, and capturing these differences is often a subtle art. These differences are often “a matter of perspective,” and...
Jason B. Alonso, Catherine Havasi, Henry Lieberman