889 search results - page 41 / 178 » Problems in Rewriting III |
IANDC
2011
13 years 4 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
In this paper we present semidefinite programming (SDP) gap instances for the following variants of the Label-Cover problem, closely related to the Unique Games Conjecture: (i) 2-...
STOC
2010
ACM
14 years 7 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
ECCV
2000
Springer
14 years 2 months ago
2000
Springer
We describe in this paper closed-form solutions to the following problems in multi-view geometry of n'th order curves: i recovery of the fundamental matrix from 4 or more c...
ICALP
1997
Springer
14 years 2 months ago
1997
Springer
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...