Sciweavers

2911 search results - page 138 / 583
» A Logic of Graph Constraints
Sort
View
CIBB
2009
15 years 1 months ago
On the Use of Temporal Formal Logic to Model Gene Regulatory Networks
Modelling activities in molecular biology face the difficulty of prediction to link molecular knowledge with cell phenotypes. Even when the interaction graph between molecules is k...
Gilles Bernot, Jean-Paul Comet
APAL
2005
93views more  APAL 2005»
15 years 18 days ago
Logical aspects of Cayley-graphs: the group case
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
Dietrich Kuske, Markus Lohrey
90
Voted
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
15 years 16 days ago
Map Genus, Forbidden Maps, and Monadic Second-Order Logic
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...
Bruno Courcelle, V. Dussaux
91
Voted
CVPR
2006
IEEE
15 years 6 months ago
Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs
We introduce the term cosegmentation which denotes the task of segmenting simultaneously the common parts of an image pair. A generative model for cosegmentation is presented. Inf...
Carsten Rother, Thomas P. Minka, Andrew Blake, Vla...
107
Voted
FCT
2009
Springer
15 years 7 months ago
On Random Betweenness Constraints
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially diļ...
Andreas Goerdt