Sciweavers

2632 search results - page 190 / 527
» Alternating Timed Automata
Sort
View
ACL
1998
15 years 6 months ago
Terminology Finite-State Preprocessing for Computational LFG
This paper presents a technique to deal with multiword nominal terminology in a computational Lexical Functional Grammar. This method treats multiword terms as single tokens by mo...
Caroline Brun
128
Voted
EACL
1993
ACL Anthology
15 years 5 months ago
New Frontiers Beyond Context-Freeness: DI-Grammars And DI-Automata
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class - the DI-grammars - cover unbound de...
Peter Staudacher
COGSCI
2010
160views more  COGSCI 2010»
15 years 4 months ago
Comprehension of Simple Quantifiers: Empirical Evaluation of a Computational Model
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...
Jakub Szymanik, Marcin Zajenkowski
FUIN
2007
133views more  FUIN 2007»
15 years 4 months ago
Intercode Regular Languages
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...
Yo-Sub Han, Kai Salomaa, Derick Wood
CG
2005
Springer
15 years 4 months ago
Fast rendering of dynamic clouds
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...
Horng-Shyang Liao, Tan-Chi Ho, Jung-Hong Chuang, C...