Sciweavers

11211 search results - page 1844 / 2243
» Rank-Sensitive Data Structures
Sort
View
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
15 years 8 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
ASPLOS
1996
ACM
15 years 8 months ago
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
Daniel J. Scales, Kourosh Gharachorloo, Chandramoh...
SIGMOD
1994
ACM
106views Database» more  SIGMOD 1994»
15 years 8 months ago
Multi-Step Processing of Spatial Joins
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
SC
1992
ACM
15 years 8 months ago
Willow: A Scalable Shared Memory Multiprocessor
We are currently developing Willow, a shared-memory multiprocessor whose design provides system capacity and performance capable of supporting over a thousand commercial microproc...
John K. Bennett, Sandhya Dwarkadas, Jay A. Greenwo...
CIDM
2009
IEEE
15 years 8 months ago
Empirical comparison of graph classification algorithms
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...
« Prev « First page 1844 / 2243 Last » Next »