Sciweavers

368 search results - page 67 / 74
» Probabilistic base calling of Solexa sequencing data
Sort
View
ECAI
2000
Springer
13 years 11 months ago
Learning Efficiently with Neural Networks: A Theoretical Comparison between Structured and Flat Representations
Abstract. We are interested in the relationship between learning efficiency and representation in the case of supervised neural networks for pattern classification trained by conti...
Marco Gori, Paolo Frasconi, Alessandro Sperduti
JACM
2002
94views more  JACM 2002»
13 years 7 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers
BMCBI
2005
133views more  BMCBI 2005»
13 years 7 months ago
Systematic determination of the mosaic structure of bacterial genomes: species backbone versus strain-specific loops
Background: Public databases now contain multitude of complete bacterial genomes, including several genomes of the same species. The available data offers new opportunities to add...
Hélène Chiapello, I. Bourgait, F. So...
CVPR
2006
IEEE
14 years 9 months ago
Robust Fragments-based Tracking using the Integral Histogram
We present a novel algorithm (which we call "FragTrack") for tracking an object in a video sequence. The template object is represented by multiple image fragments or pa...
Amit Adam, Ehud Rivlin, Ilan Shimshoni
PAMI
2008
145views more  PAMI 2008»
13 years 7 months ago
Latent-Space Variational Bayes
Variational Bayesian Expectation-Maximization (VBEM), an approximate inference method for probabilistic models based on factorizing over latent variables and model parameters, has ...
JaeMo Sung, Zoubin Ghahramani, Sung Yang Bang