4190 search results - page 436 / 838 » Type Class Directives |
194
click to vote
ICLP
2005
Springer
16 years 1 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
195
Voted
PVM
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. The Fortran language has evolved substantially from the Fortran 77 bindings defined in the MPI-1 (Message Passing Interface) standard. Fortran 90 introduced interface bl...
214
click to vote
AMDO
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. In this paper new results are presented for tracking complex multi-body objects. The theoretical framework is based on robotics techniques and uses an a-priori model of t...
230
click to vote
ATAL
2004
Springer
16 years 1 months ago
2004
Springer
This paper describes our work constructing a generalized framework for modeling multi agent interactions in education-related applications. Historically, interactive learning syst...
197
click to vote
VLDB
2004
ACM
16 years 1 months ago
2004
ACM
1 Frequent itemset counting is the first step for most association rule algorithms and some classification algorithms. It is the process of counting the number of occurrences of ...