478 search results - page 65 / 96 » Monads of Regular Theories |
ICMCS
2006
IEEE
15 years 5 months ago
2006
IEEE
This paper presents a new spatio-temporal motion estimation algorithm for video coding. The algorithm is based on optimization theory and consists of the strategies including 3D s...
108
Voted
IJCNN
2006
IEEE
15 years 5 months ago
2006
IEEE
— It is a challenging task for multiple robots working together to realize object transportation. This paper studies a practical situation that a group of mobile manipulators are...
ACMSE
2006
ACM
15 years 5 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...
SPAA
2005
ACM
15 years 4 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
FCT
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...