We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
Russ Tedrake, Ian R. Manchester, Mark Tobenkin, Jo...
We address the problem of pronunciation variation in conversational speech with a context-dependent articulatory featurebased model. The model is an extension of previous work usi...
Preethi Jyothi, Karen Livescu, Eric Fosler-Lussier