125 search results - page 6 / 25 » Finding Skew Partitions Efficiently |
CATS
2006
13 years 9 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Traditional similarity or distance measurements usually become meaningless when the dimensions of the datasets increase, which has detrimental effects on clustering performance. I...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
We describe an ensemble approach to learning1 salient regions from data partitioned according to the2 distributed processing requirements of large-scale sim-3 ulations. The volume...
ICDE
2007
IEEE
13 years 11 months ago
2007
IEEE
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased traffic, and higher speed links. These characteristics lead to the prevalence of hard...