804 search results - page 97 / 161 » Experiments on Union-Find Algorithms for the Disjoint-Set Da... |
JPDC
2008
13 years 7 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
PAKDD
2010
ACM
14 years 17 days ago
2010
ACM
In this paper, we propose a method for online subsequence matching between histogram-based stream synopsis structures under the dynamic warping distance. Given a query synopsis pat...
ADMA
2008
Springer
13 years 9 months ago
2008
Springer
With a large number of news available on the internet everyday, it is an interesting work to automatically organize news events by time order and dependencies between events. The w...
ICDIM
2008
IEEE
14 years 2 months ago
2008
IEEE
We describe a recommender system based on Dynamically Structured Holographic Memory (DSHM), a cognitive model of associative memory that uses holographic reduced representations a...
ICDM
2002
IEEE
14 years 22 days ago
2002
IEEE
Previous works on automatic query clustering most generate a flat, un-nested partition of query terms. In this work, we are pursuing to organize query terms into a hierarchical s...