2635 search results - page 89 / 527 » Algorithms for the Database Layout Problem |
125
Voted
ICLP
1999
Springer
15 years 8 months ago
1999
Springer
Concurrency in Logic Programming has received much attention in the past. One problem with many proposals, when applied to Prolog, is that they involve large modifications to the...
147
click to vote
LWA
2004
15 years 5 months ago
2004
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
141
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
129
Voted
AI
2011
Springer
14 years 11 months ago
2011
Springer
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
134
click to vote
PDP
2008
IEEE
15 years 10 months ago
2008
IEEE
Matrix computation algorithms often exhibit dependencies between neighboring elements inside loop nests such that the frontier between computed elements and those to be computed w...