Sciweavers

1000 search results - page 63 / 200
» Dependency Tree Automata
Sort
View
ACL
2007
15 years 1 months ago
K-best Spanning Tree Parsing
This paper introduces a Maximum Entropy dependency parser based on an efficient kbest Maximum Spanning Tree (MST) algorithm. Although recent work suggests that the edge-factored ...
Keith Hall
ENTCS
2008
109views more  ENTCS 2008»
14 years 12 months ago
Spatial Networks of Hybrid I/O Automata for Modeling Excitable Tissue
We propose a new biological framework, spatial networks of hybrid input/output automata (SNHIOA), for the efficient modeling and simulation of excitable-cell tissue. Within this f...
Ezio Bartocci, Flavio Corradini, Maria Rita Di Ber...
ACSD
2006
IEEE
129views Hardware» more  ACSD 2006»
15 years 6 months ago
Extended Timed Automata and Time Petri Nets
Timed Automata (TA) and Time Petri Nets (TPN) are two well-established formal models for real-time systems. Recently, a linear transformation of TA to TPNs preserving reachability...
Patricia Bouyer, Pierre-Alain Reynier, Serge Hadda...
IJBC
2006
50views more  IJBC 2006»
14 years 12 months ago
Phenomenology of Reaction-diffusion Binary-State Cellular Automata
We study a binary-cell-states eight-cell neighborhood two-dimensional cellular automaton model of a quasi-chemical system with a substrate and a reagent. Reactions are represented...
Andrew Adamatzky, Genaro Juárez Martí...
CDC
2008
IEEE
156views Control Systems» more  CDC 2008»
15 years 6 months ago
Diagnosability of hybrid automata with measurement uncertainty
— We propose a diagnosability notion that depends on two parameters denoted as (δd, δm) for the general class of transition systems where the observable output is given by disc...
Maria Domenica Di Benedetto, Stefano Di Gennaro, A...