Sciweavers

363 search results - page 5 / 73
» Partial Multicuts in Trees
Sort
View
IJFCS
1998
67views more  IJFCS 1998»
13 years 8 months ago
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni
CORR
2000
Springer
110views Education» more  CORR 2000»
13 years 8 months ago
Efficient probabilistic top-down and left-corner parsing
This paper examines efficient predictive broadcoverage parsing without dynamic programming. In contrast to bottom-up methods, depth-first top-down parsing produces partial parses ...
Brian Roark, Mark Johnson
ACL
2001
13 years 10 months ago
Topological Dependency Trees: A Constraint-Based Account of Linear Precedence
We describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutua...
Denys Duchier, Ralph Debusmann
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
13 years 8 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
BMCBI
2010
108views more  BMCBI 2010»
13 years 8 months ago
iGTP: A software package for large-scale gene tree parsimony analysis
Background: The ever-increasing wealth of genomic sequence information provides an unprecedented opportunity for large-scale phylogenetic analysis. However, species phylogeny infe...
Ruchi Chaudhary, Mukul S. Bansal, André Weh...