749 search results - page 78 / 150 » Combinatory Models and Symbolic Computation |
ICCV
2007
IEEE
14 years 12 months ago
2007
IEEE
In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...
SAC
1994
ACM
14 years 2 months ago
1994
ACM
An extension of Me parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to dea...
JAIR
2006
13 years 10 months ago
2006
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
CINQ
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
FPL
2003
Springer
14 years 3 months ago
2003
Springer
By adapting to computations that are not so well supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. Such computational sy...