Sciweavers

1000 search results - page 60 / 200
» Dependency Tree Automata
Sort
View
SAC
2009
ACM
15 years 6 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi
ASE
2002
160views more  ASE 2002»
14 years 11 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
ACL
2009
14 years 9 months ago
Quadratic-Time Dependency Parsing for Machine Translation
Efficiency is a prime concern in syntactic MT decoding, yet significant developments in statistical parsing with respect to asymptotic efficiency haven't yet been explored in...
Michel Galley, Christopher D. Manning
DBPL
2005
Springer
135views Database» more  DBPL 2005»
15 years 5 months ago
Type-Based Optimization for Regular Patterns
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
Michael Y. Levin, Benjamin C. Pierce
IJFCS
2008
63views more  IJFCS 2008»
14 years 12 months ago
How to Synchronize the Activity of All Components of a P System?
We consider the problem of synchronizing the activity of all the membranes of a P system. After pointing at the connection with a similar problem dealt with in the field of cellul...
Francesco Bernardini, Marian Gheorghe, Maurice Mar...