Search Results for author:
Found 3 papers, 1 papers with code
Exact inference under the perfect phylogeny model
We use a careful combination of algorithms, software, and hardware, to develop EXACT: a tool that can explore the space of all possible phylogenetic trees, and performs exact inference under the PPM with noisy data.
Tractable $n$-Metrics for Multiple Graphs
In the context of comparing graphs, we are the first to show the existence of multi-distances that simultaneously incorporate the useful property of alignment consistency (Nguyen et al. 2011), and a generalized metric property.
An Explicit Convergence Rate for Nesterov's Method from SDP
The framework of Integral Quadratic Constraints (IQC) introduced by Lessard et al. (2014) reduces the computation of upper bounds on the convergence rate of several optimization algorithms to semi-definite programming (SDP).
