Login / Signup
A linear bound on the number of states in optimal convex characters for maximum parsimony distance.
Olivier Boes
Mareike Fischer
Steven Kelk
Published in:
CoRR (2015)
Keyphrases
</>
semi infinite programming
minimum distance
neural network
optimal solution
upper bound
worst case
average distance
lower bound
natural language processing
sensitivity analysis
piecewise linear
semidefinite
constant factor
linear functions