Sciweavers

1000 search results - page 48 / 200
» Dependency Tree Automata
Sort
View
ACL
2011
14 years 3 months ago
Temporal Restricted Boltzmann Machines for Dependency Parsing
We propose a generative model based on Temporal Restricted Boltzmann Machines for transition based dependency parsing. The parse tree is built incrementally using a shiftreduce pa...
Nikhil Garg, James Henderson
IEEECIT
2009
IEEE
15 years 6 months ago
Clustering of Software Systems Using New Hybrid Algorithms
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
Ali Safari Mamaghani, Mohammad Reza Meybodi
FAC
2008
100views more  FAC 2008»
14 years 12 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
CAV
2005
Springer
99views Hardware» more  CAV 2005»
15 years 5 months ago
Automated Assume-Guarantee Reasoning for Simulation Conformance
Abstract. We address the issue of efficiently automating assume-guarantee reasoning for simulation conformance between finite state systems and specifications. We focus on a non...
Sagar Chaki, Edmund M. Clarke, Nishant Sinha, Pras...
ACRI
2006
Springer
15 years 5 months ago
On Spiral Glider-Guns in Hexagonal Cellular Automata: Activator-Inhibitor Paradigm
We present a cellular-automaton model of a reaction-diffusion excitable system with concentration dependent inhibition of the activator, and study the dynamics of mobile localiza...
Andrew Wuensche