Sciweavers

12825 search results - page 183 / 2565
» Improved PLSOM algorithm
Sort
View
TIT
2008
76views more  TIT 2008»
15 years 5 months ago
Improved Risk Tail Bounds for On-Line Algorithms
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
Nicolò Cesa-Bianchi, Claudio Gentile
BMCBI
2011
14 years 8 months ago
Improving pan-genome annotation using whole genome multiple alignment
Background: Rapid annotation and comparisons of genomes from multiple isolates (pan-genomes) is becoming commonplace due to advances in sequencing technology. Genome annotations c...
Samuel V. Angiuoli, Julie C. Dunning Hotopp, Steve...
INFORMATICALT
2006
88views more  INFORMATICALT 2006»
15 years 5 months ago
Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
Ionel Muscalagiu, Vladimir Cretu
AIA
2007
15 years 6 months ago
Improving the aggregating algorithm for regression
Kernel Ridge Regression (KRR) and the recently developed Kernel Aggregating Algorithm for Regression (KAAR) are regression methods based on Least Squares. KAAR has theoretical adv...
Steven Busuttil, Yuri Kalnishkan, Alexander Gammer...
BMCBI
2005
119views more  BMCBI 2005»
15 years 5 months ago
GASH: An improved algorithm for maximizing the number of equivalent residues between two protein structures
Background: We introduce GASH, a new, publicly accessible program for structural alignment and superposition. Alignments are scored by the Number of Equivalent Residues (NER), a q...
Daron M. Standley, Hiroyuki Toh, Haruki Nakamura