552 search results - page 32 / 111 » On the Complexity of Join Predicates |
SDM
2008
SIAM
15 years 8 days ago
2008
SIAM
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
COMGEO
2010
ACM
14 years 11 months ago
2010
ACM
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
LATIN
2010
Springer
14 years 9 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
93
Voted
DEXAW
1999
IEEE
15 years 3 months ago
1999
IEEE
ing spatio-temporal data as abstract data types into already existing data models is a promising approach to creating spatio-temporal query languages. In this context, an importan...
97
Voted
CIDR
2003
15 years 7 days ago
2003
Traditional science searched for new objects and phenomena that led to discoveries. Tomorrow's science will combine together the large pool of information in scientific archi...