77 search results - page 11 / 16 » A Note on the Asymptotics and Computational Complexity of Gr... |
AGTIVE
2003
Springer
14 years 21 days ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
AI
2002
Springer
13 years 7 months ago
2002
Springer
Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two imp...
RECOMB
2003
Springer
14 years 7 months ago
2003
Springer
We develop an integrated probabilistic model to combine protein physical interactions, genetic interactions, highly correlated gene expression network, protein complex data, and d...
ESA
1998
Springer
13 years 11 months ago
1998
Springer
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
ACL
1993
13 years 8 months ago
1993
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...