2229 search results - page 38 / 446 » The Case for Grounding Databases |
DATE
2009
IEEE
14 years 4 months ago
2009
IEEE
—The synchronous model of computation together with a suitable execution platform facilitates system-level timing predictability. This paper introduces an algebraic framework for...
ASIAN
1998
Springer
14 years 2 months ago
1998
Springer
We show that rigid reachability, the non-symmetric form of rigid E-unification, is undecidable already in the case of a single constraint. From this we infer the undecidability of ...
SIGMETRICS
1999
ACM
14 years 2 months ago
1999
ACM
Data analysis in very large databases requires innovative techniques. In an exploration and discovery scenario, the performance of standard SQL techniques can be unacceptable. Thi...
DEXAW
2000
IEEE
14 years 2 months ago
2000
IEEE
In this paper we explore the applicability of an algorithm designed for finding association rules in large databases to the discovery of relevant associations from a large case ba...
AIED
2005
Springer
14 years 3 months ago
2005
Springer
In this paper, we show how using data mining algorithms can help discovering pedagogically relevant knowledge contained in databases obtained from Web-based educational systems. Th...