Sciweavers

372 search results - page 64 / 75
» On the Structural Complexity of Natural Language Sentences
Sort
View
COLING
1996
13 years 8 months ago
Error-tolerant Tree Matching
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
Kemal Oflazer
IJCAI
1989
13 years 8 months ago
A Knowledge-Based Software Information System
The difficulty of maintaining very large software systems is becoming more widely acknowledged. One of the primary problems is the need to access information about a complex and e...
Premkumar T. Devanbu, Peter G. Selfridge, Bruce W....
CMSB
2011
Springer
12 years 7 months ago
Coloured stochastic multilevel multiset rewriting
From the phosphorylation state of a molecule to the volume of a cell, parameters are ubiquitous in systems biology. At the same time, most models involve static or dynamic compart...
Nicolas Oury, Gordon D. Plotkin
ICALP
2010
Springer
13 years 9 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
CONCUR
2007
Springer
14 years 1 months ago
Rule-Based Modelling of Cellular Signalling
Abstract. Modelling is becoming a necessity in studying biological signalling pathways, because the combinatorial complexity of such systems rapidly overwhelms intuitive and qualit...
Vincent Danos, Jérôme Feret, Walter F...