Sciweavers

6542 search results - page 1297 / 1309
» The tao of parallelism in algorithms
Sort
View
ECCV
2010
Springer
13 years 9 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
BMCBI
2010
176views more  BMCBI 2010»
13 years 9 months ago
Reverse engineering gene regulatory network from microarray data using linear time-variant model
nd: Gene regulatory network is an abstract mapping of gene regulations in living cells that can help to predict the system behavior of living organisms. Such prediction capability...
Mitra Kabir, Nasimul Noman, Hitoshi Iba
BMCBI
2010
142views more  BMCBI 2010»
13 years 9 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...
BMCBI
2008
154views more  BMCBI 2008»
13 years 9 months ago
GeNESiS: gene network evolution simulation software
Background: There has been a lot of interest in recent years focusing on the modeling and simulation of Gene Regulatory Networks (GRNs). However, the evolutionary mechanisms that ...
Anton Kratz, Masaru Tomita, Arun Krishnan
BMCBI
2010
134views more  BMCBI 2010»
13 years 9 months ago
R-Gada: a fast and flexible pipeline for copy number analysis in association studies
Background: Genome-wide association studies (GWAS) using Copy Number Variation (CNV) are becoming a central focus of genetic research. CNVs have successfully provided target genom...
Roger Pique-Regi, Alejandro Cáceres, Juan R...
« Prev « First page 1297 / 1309 Last » Next »