8228 search results - page 85 / 1646 » Structural Logical Relations |
CIE
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
SSDBM
2003
IEEE
14 years 3 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
ESWS
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. Wikipedia, a collaborative Wiki-based encyclopedia, has become a huge phenomenon among Internet users. It covers huge number of concepts of various fields such as Arts, G...
ICML
2003
IEEE
14 years 11 months ago
2003
IEEE
This paper introduces an approach for identifying predictive structures in relational data using the multiple-instance framework. By a predictive structure, we mean a structure th...
DAWAK
1999
Springer
14 years 2 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...