2834 search results - page 79 / 567 » Representing Trees with Constraints |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
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...
LREC
2010
13 years 11 months ago
2010
This paper describes a hybrid tagger/parser for French (FrAG), and presents results from ongoing development work, corpus annotation and evaluation. The core of the system is a se...
RTSS
1992
IEEE
14 years 2 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
ICDAR
2007
IEEE
14 years 4 months ago
2007
IEEE
Logical entity recognition in heterogeneous collections of document page images remains a challenging problem since the performance of traditional supervised methods degrade drama...
COMBINATORICS
2006
13 years 10 months ago
2006
![Characterization of [1, k]-Bar Visibility Trees](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/characterization_of_1_k_bar_visibility_trees_COMBINATORICS_2006.jpg "Characterization of [1, k]-Bar Visibility Trees")
A unit bar-visibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unit-length bars such that two vertices are adjacent if and only if th...