974 search results - page 28 / 195 » pairing 2010 |
ICPR
2010
IEEE
14 years 1 months ago
2010
IEEE
A novel 3D shape matching method is proposed in this paper. We first extract angular and distance feature pairs from pre-processed 3D models, then estimate their kernel densities ...
ENTCS
2006
13 years 7 months ago
2006
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
GG
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
ENTCS
2007
13 years 7 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
INTERSPEECH
2010
13 years 2 months ago
2010
In this paper we investigate a computational model of word learning that is cognitively plausible. The model is partly trained on incorrect form-referent pairings, modelling the i...