2635 search results - page 124 / 527 » Algorithms for the Database Layout Problem |
134
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
171
click to vote
DEXA
2010
Springer
15 years 4 months ago
2010
Springer
Given a large collection of objects, finding all pairs of similar objects, namely similarity join, is widely used to solve various problems in many application domains.Computation ...
116
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
166
click to vote
ICDM
2002
IEEE
15 years 9 months ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
161
click to vote
CASES
2010
ACM
15 years 2 months ago
2010
ACM
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...