4926 search results - page 716 / 986 » Two Graph Algorithms On an Associative Computing Model |
AUSDM
2007
Springer
14 years 2 months ago
2007
Springer
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
An important problem in data mining is detecting changes in large data sets. Although there are a variety of change detection algorithms that have been developed, in practice it c...
MICRO
1997
IEEE
14 years 15 days ago
1997
IEEE
Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory ha...
RTS
2011
13 years 3 months ago
2011
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
SIGGRAPH
2010
ACM
14 years 24 days ago
2010
ACM
High-order and regularly sampled surface representations are more efficient and compact than general meshes and considerably simplify many geometric modeling and processing algor...