Sciweavers

1243 search results - page 188 / 249
» Generating Trees on Multisets
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 10 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
JCT
2007
94views more  JCT 2007»
14 years 9 months ago
A bijection between 2-triangulations and pairs of non-crossing Dyck paths
A k-triangulation of a convex polygon is a maximal set of diagonals so that no k + 1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a...
Sergi Elizalde
BMCBI
2011
14 years 4 months ago
iPhy: an integrated phylogenetic workbench for supermatrix analyses
Background: The increasing availability of molecular sequence data means that the accuracy of future phylogenetic studies is likely to by limited by systematic bias and taxon choi...
Martin O. Jones, Georgios D. Koutsovoulos, Mark L....
PLDI
2010
ACM
15 years 7 months ago
A Context-free Markup Language for Semi-structured Text
An ad hoc data format is any non-standard, semi-structured data format for which robust data processing tools are not available. In this paper, we present ANNE, a new kind of mark...
Qian Xi, David Walker
WSDM
2009
ACM
161views Data Mining» more  WSDM 2009»
15 years 4 months ago
Predicting the readability of short web summaries
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
Tapas Kanungo, David Orr