Sciweavers

1403 search results - page 88 / 281
» Set cover algorithms for very large datasets
Sort
View
IPPS
2009
IEEE
15 years 11 months ago
Power-aware load balancing of large scale MPI applications
Power consumption is a very important issue for HPC community, both at the level of one application or at the level of whole workload. Load imbalance of a MPI application can be e...
Maja Etinski, Julita Corbalán, Jesús...
WWW
2007
ACM
16 years 5 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...
DATE
2009
IEEE
159views Hardware» more  DATE 2009»
15 years 11 months ago
Design and implementation of a database filter for BLAST acceleration
— BLAST is a very popular Computational Biology algorithm. Since it is computationally expensive it is a natural target for acceleration research, and many reconfigurable archite...
Panagiotis Afratis, Constantinos Galanakis, Euripi...
JDCTA
2010
152views more  JDCTA 2010»
14 years 11 months ago
Spatial Clustering Algorithm Based on Hierarchical-Partition Tree
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...
Zhongzhi Li, Xuegang Wang
AAAI
2006
15 years 5 months ago
A Fast Decision Tree Learning Algorithm
There is growing interest in scaling up the widely-used decision-tree learning algorithms to very large data sets. Although numerous diverse techniques have been proposed, a fast ...
Jiang Su, Harry Zhang