Sciweavers

11565 search results - page 2077 / 2313
» Computing Minimal Mappings
Sort
View
JPDC
2006
85views more  JPDC 2006»
15 years 6 months ago
Provable algorithms for parallel generalized sweep scheduling
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
BMCBI
2005
134views more  BMCBI 2005»
15 years 6 months ago
Windows .NET Network Distributed Basic Local Alignment Search Toolkit (W.ND-BLAST)
Background: BLAST is one of the most common and useful tools for Genetic Research. This paper describes a software application we have termed Windows .NET Distributed Basic Local ...
Scot E. Dowd, Joaquin Zaragoza, Javier R. Rodrigue...
BMCBI
2005
136views more  BMCBI 2005»
15 years 6 months ago
Automatic detection of false annotations via binary property clustering
Background: Computational protein annotation methods occasionally introduce errors. Falsepositive (FP) errors are annotations that are mistakenly associated with a protein. Such f...
Noam Kaplan, Michal Linial
BMCBI
2005
212views more  BMCBI 2005»
15 years 6 months ago
PAGE: Parametric Analysis of Gene Set Enrichment
Background: Gene set enrichment analysis (GSEA) is a microarray data analysis method that uses predefined gene sets and ranks of genes to identify significant biological changes i...
Seon-Young Kim, David J. Volsky
PR
2007
100views more  PR 2007»
15 years 6 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
« Prev « First page 2077 / 2313 Last » Next »