Sciweavers

520 search results - page 71 / 104
» Subset Counting in Trees
Sort
View
SIAMCOMP
2008
78views more  SIAMCOMP 2008»
13 years 7 months ago
I/O-Efficient Planar Separators
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. ...
Anil Maheshwari, Norbert Zeh
RECOMB
2010
Springer
13 years 6 months ago
An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model
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 ...
Aïda Ouangraoua, Krister M. Swenson, Cedric C...
NAACL
2010
13 years 5 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
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...
Daniel Gildea
IJRR
2010
132views more  IJRR 2010»
13 years 5 months ago
LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification
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...
ICASSP
2011
IEEE
12 years 11 months ago
Lexical access experiments with context-dependent articulatory feature-based models
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