125 search results - page 8 / 25 » A Fast Parallel Clustering Algorithm for Large Spatial Datab... |
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
A metascalable (or “design once, scale on new architectures”) parallel computing framework has been developed for large spatiotemporal-scale atomistic simulations of materials...
SIGMOD
2005
ACM
14 years 1 months ago
2005
ACM
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
ICCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
SPAA
1997
ACM
13 years 11 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...