302 search results - page 60 / 61 » Efficient frequent pattern mining over data streams |
KDD
2007
ACM
14 years 11 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
VIS
2007
IEEE
15 years 3 days ago
2007
IEEE
Pipeline architectures provide a versatile and efficient mechanism for constructing visualizations, and they have been implemented in numerous libraries and applications over the p...
KDD
2005
ACM
14 years 11 months ago
2005
ACM
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
KDD
2000
ACM
14 years 2 months ago
2000
ACM
Decision trees have been successfully used for the task of classification. However, state-of-the-art algorithms do not incorporate the user in the tree construction process. This ...
EDBT
2008
ACM
14 years 11 months ago
2008
ACM
We consider an environment of numerous moving objects, equipped with location-sensing devices and capable of communicating with a central coordinator. In this setting, we investig...