Sciweavers

520 search results - page 21 / 104
» Computing recombination networks from binary sequences
Sort
View
BMCBI
2010
142views more  BMCBI 2010»
14 years 10 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...
JMLR
2008
148views more  JMLR 2008»
14 years 9 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
CAIP
2009
Springer
221views Image Analysis» more  CAIP 2009»
15 years 4 months ago
Model Based Analysis of Face Images for Facial Feature Extraction
This paper describes a comprehensive approach to extract a common feature set from the image sequences. We use simple features which are easily extracted from a 3D wireframe model ...
Zahid Riaz, Christoph Mayer, Michael Beetz, Bernd ...
ICPR
2004
IEEE
15 years 11 months ago
Synchronization and Calibration of Camera Networks from Silhouettes
We propose an automatic approach to synchronize a network of uncalibrated and unsynchronized video cameras, and recover the complete calibration of all these cameras. In this pape...
Sudipta N. Sinha, Marc Pollefeys
PODC
2010
ACM
15 years 1 months ago
Brief announcement: complexity and solution of the send-receive correlation problem
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
Benito van der Zander, Egon Wanke, Wolfgang Kie&sz...