1487 search results - page 14 / 298 » Two Kinds of Metonymy |
HICSS
2011
IEEE
12 years 11 months ago
2011
IEEE
There has been something of an academic debate between proponents of two different kinds of computer self-efficacy: general computer self-efficacy ala Compeau and Higgins on the o...
EVOW
2006
Springer
13 years 11 months ago
2006
Springer
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...
CSL
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. For nested or heterogeneous datatypes, terminating recursion schemes considered so far have been instances of iteration, excluding efficient definitions of fixed-point ...
LORI
2009
Springer
14 years 1 days ago
2009
Springer
Abstract. The aim of this work is propose a logical approach to intention dynamics based on the notion of assignment [7, 3]. The function of an assignment is to associate the truth...