1403 search results - page 1 / 281 » Set cover algorithms for very large datasets |
CIKM
2010
Springer
13 years 2 months ago
2010
Springer
ICML
2008
IEEE
14 years 5 months ago
2008
IEEE
In EM and related algorithms, E-step computations distribute easily, because data items are independent given parameters. For very large data sets, however, even storing all of th...
VLDB
1999
ACM
13 years 8 months ago
1999
ACM
Many efficient algorithms to compute multidimensional aggregation and Cube for relational OLAP have been developed. However, to our knowledge, there is nothing to date in the lite...
AI
2005
Springer
13 years 10 months ago
2005
Springer
Spatial clustering is an active research area in spatial data mining with various methods reported. In this paper, we compare two density-based methods, DBSCAN and DBRS. First, we ...
VLDB
2004
ACM
14 years 4 months ago
2004
ACM
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...