219 search results - page 18 / 44 » Combinatorial Complexity of Regular Languages |
110
click to vote
LATIN
1992
Springer
15 years 8 months ago
1992
Springer
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
163
click to vote
EMNLP
2011
14 years 4 months ago
2011
Dual decomposition has been recently proposed as a way of combining complementary models, with a boost in predictive power. However, in cases where lightweight decompositions are ...
186
click to vote
JMLR
2012
13 years 6 months ago
2012
In this paper we propose a new approach for semi-supervised structured output learning. Our approach uses relaxed labeling on unlabeled data to deal with the combinatorial nature ...
149
click to vote
TOG
2008
15 years 4 months ago
2008
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
166
Voted
DBPL
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...