142 search results - page 20 / 29 » Matrix Trees |
136
click to vote
CP
2003
Springer
15 years 5 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
102
Voted
RECOMB
2005
Springer
16 years 10 hour ago
2005
Springer
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
125
click to vote
JCB
2006
14 years 11 months ago
2006
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
137
click to vote
JMLR
2010
14 years 6 months ago
2010
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
113
click to vote
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—The paper addresses the maximal lifetime problem in sensor-target surveillance networks. Given a set of sensors and targets in an Euclidean plane, each sensor can watch all targ...