Sciweavers

11716 search results - page 402 / 2344
» Computable symbolic dynamics
Sort
View
TRIER
2002
15 years 6 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl
ECEASST
2010
15 years 4 months ago
Graph Algebras for Bigraphs
In this talk we will present a new approach to deal with attributed graphs and attributed graph transformation. The approach is based on working with what we call symbolic graphs, ...
Davide Grohmann, Marino Miculan
ACL
2011
14 years 10 months ago
An Unsupervised Model for Joint Phrase Alignment and Extraction
We present an unsupervised model for joint phrase alignment and extraction using nonparametric Bayesian methods and inversion transduction grammars (ITGs). The key contribution is...
Graham Neubig, Taro Watanabe, Eiichiro Sumita, Shi...
PROCEDIA
2011
14 years 9 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
ACII
2011
Springer
14 years 6 months ago
Expressive Gesture Model for Humanoid Robot
Abstract. This paper presents an expressive gesture model that generates communicative gestures accompanying speech for the humanoid robot Nao. The research work focuses mainly on ...
Le Quoc Anh, Catherine Pelachaud