1246 search results - page 174 / 250 » Recursive Timed Automata |
108
Voted
COGSCI
2010
15 years 2 months ago
2010
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...
123
click to vote
FUIN
2007
15 years 2 months ago
2007
Intercodes are a generalization of comma-free codes. Using the structural properties of finite-state automata recognizing an intercode we develop a polynomial-time algorithm for d...
110
click to vote
CG
2005
Springer
15 years 2 months ago
2005
Springer
We propose an efficient framework for dynamic cloud rendering. Base on the proposed simplified lighting model, the Shadow Relation Table (SRT) and Metaball Lighting Texture Databa...
133
click to vote
MTA
2007
15 years 2 months ago
2007
Abstract. In this paper we address the problem of comparing multimedia documents, which can be described according to different reference models. If we consider presentations as c...
155
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...