125 search results - page 9 / 25 » Finding Skew Partitions Efficiently |
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. The coalition structure formation problem represents an active research area in multi-agent systems. A coalition structure is defined as a partition of the agents involve...
AIMSA
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. The coalition structure generation problem represents an active research area in multi-agent systems. A coalition structure is defined as a partition of the agents involv...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
CLUSTER
2005
IEEE
14 years 1 months ago
2005
IEEE
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...