21 search results - page 1 / 5 » Computing Blocker Sets for the Regular Post Embedding Proble... |
DLT
2010
13 years 6 months ago
2010
Abstract. Blocker and coblocker sets are regular languages involved in the algorithmic solution of the Regular Post Embedding Problem. We investigate the computability of these lan...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...
JGAA
2006
13 years 4 months ago
2006
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
CVPR
2009
IEEE
14 years 12 months ago
2009
IEEE
We propose a novel framework for constrained spectral
clustering with pairwise constraints which specify whether
two objects belong to the same cluster or not. Unlike previous
m...