Sciweavers

2127 search results - page 256 / 426
» Computing large matchings fast
Sort
View
TCBB
2008
122views more  TCBB 2008»
15 years 4 months ago
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
ICDAR
2009
IEEE
15 years 2 months ago
Recurrent HMMs and Cursive Handwriting Recognition Graphs
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...
Marc-Peter Schambach
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 7 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
BMCBI
2006
137views more  BMCBI 2006»
15 years 4 months ago
Genome BLAST distance phylogenies inferred from whole plastid and whole mitochondrion genome sequences
Background: Phylogenetic methods which do not rely on multiple sequence alignments are important tools in inferring trees directly from completely sequenced genomes. Here, we exte...
Alexander F. Auch, Stefan R. Henz, Barbara R. Holl...
HUC
2010
Springer
15 years 4 months ago
Tasking networked CCTV cameras and mobile phones to identify and localize multiple people
We present a method to identify and localize people by leveraging existing CCTV camera infrastructure along with inertial sensors (accelerometer and magnetometer) within each pers...
Thiago Teixeira, Deokwoo Jung, Andreas Savvides