Sciweavers

732 search results - page 123 / 147
» Axiomatising timed automata
Sort
View
FUIN
2007
133views more  FUIN 2007»
13 years 7 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
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...
MTA
2007
83views more  MTA 2007»
13 years 7 months ago
A study on multimedia documents behavior: a notion of equivalence
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...
Paola Bertolotti, Ombretta Gaggi
CORR
2011
Springer
162views Education» more  CORR 2011»
13 years 2 months ago
Isomorphism of regular trees and words
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...
Markus Lohrey, Christian Mathissen
ACSD
2006
IEEE
81views Hardware» more  ACSD 2006»
14 years 1 months ago
Monitoring and fault-diagnosis with digital clocks
We study the monitoring and fault-diagnosis problems for dense-time real-time systems, where observers (monitors and diagnosers) have access to digital rather than analog clocks. ...
Karine Altisen, Franck Cassez, Stavros Tripakis