460 search results - page 22 / 92 » Computational Analysis of Move Structures in Academic Abstra... |
IANDC
2006
14 years 9 months ago
2006
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
CP
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
CONCUR
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. The ambient calculus is a calculus of computation that allows active processes (mobile ambients) to move between sites. A firewall is said to be protective whenever it d...
ICPR
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper we address the object recognition problem in a probabilistic framework to detect and describe object appearance through image features organized by means of active c...
109
click to vote
NDQA
2003
14 years 11 months ago
2003
Growth in government investment, academic research, and commercial question answering (QA) systems is motivating a need for increased planning and coordination. The internationali...