Sciweavers

213 search results - page 27 / 43
» Relating Word and Tree Automata
Sort
View
CG
2005
Springer
13 years 7 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...
ICST
2009
IEEE
13 years 5 months ago
Timed Testing under Partial Observability
This paper studies the problem of model-based testing of real-time systems that are only partially observable. We model the System Under Test (SUT) using Timed Game Automata (TGA)...
Alexandre David, Kim Guldstrand Larsen, Shuhao Li,...
JCT
2008
103views more  JCT 2008»
13 years 7 months ago
A bijective proof of Jackson's formula for the number of factorizations of a cycle
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
Gilles Schaeffer, Ekaterina A. Vassilieva
JSC
2006
95views more  JSC 2006»
13 years 7 months ago
Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
Nicholas Eriksson, Stephen E. Fienberg, Alessandro...
NAACL
2010
13 years 5 months ago
Syntactic/Semantic Structures for Textual Entailment Recognition
In this paper, we describe an approach based on off-the-shelf parsers and semantic resources for the Recognizing Textual Entailment (RTE) challenge that can be generally applied t...
Yashar Mehdad, Alessandro Moschitti, Fabio Massimo...