Sciweavers

11910 search results - page 2305 / 2382
» Online Learning Algorithms
Sort
View
NIPS
2003
13 years 10 months ago
Boosting versus Covering
We investigate improvements of AdaBoost that can exploit the fact that the weak hypotheses are one-sided, i.e. either all its positive (or negative) predictions are correct. In pa...
Kohei Hatano, Manfred K. Warmuth
BMCBI
2010
133views more  BMCBI 2010»
13 years 9 months ago
New components of the Dictyostelium PKA pathway revealed by Bayesian analysis of expression data
Background: Identifying candidate genes in genetic networks is important for understanding regulation and biological function. Large gene expression datasets contain relevant info...
Anup Parikh, Eryong Huang, Christopher Dinh, Blaz ...
BMCBI
2010
102views more  BMCBI 2010»
13 years 9 months ago
Peptide binding predictions for HLA DR, DP and DQ molecules
Background: MHC class II binding predictions are widely used to identify epitope candidates in infectious agents, allergens, cancer and autoantigens. The vast majority of predicti...
Peng Wang, John Sidney, Yohan Kim, Alessandro Sett...
CN
2006
85views more  CN 2006»
13 years 9 months ago
A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is ...
Simon Balon, Laurent Mélon, Guy Leduc
BMCBI
2007
145views more  BMCBI 2007»
13 years 9 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
« Prev « First page 2305 / 2382 Last » Next »