16430 search results - page 337 / 3286 » On Computable Tree Functions |
128
Voted
VLDB
1999
ACM
15 years 9 months ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
72
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Machines for Dialogue Games P.-L. Curien (CNRS - Paris 7) H. Herbelin (INRIA-Futurs) July 16, 2005 The notion of abstract B¨ohm tree has arisen as an operationally-oriented disti...
156
click to vote
IJIS
2011
14 years 8 months ago
2011
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
179
click to vote
JAIHC
2010
15 years 3 months ago
2010
The state of the art is explored in using soft computing (SC) methods for network intrusion detection, including the examination of efforts in ten specific areas of SC as well as ...
127
click to vote
PERCOM
2004
ACM
16 years 4 months ago
2004
ACM
Applications in the Pervasive Computing domain are challenged by the dynamism in which their execution environment changes, e.g. due to user mobility. As a result, applications ha...