1951 search results - page 119 / 391 » An algorithm for improving graph partitions |
152
click to vote
GD
2004
Springer
15 years 10 months ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
150
click to vote
DASFAA
2004
IEEE
15 years 8 months ago
2004
IEEE
Text classification using a small labeled set and a large unlabeled data is seen as a promising technique to reduce the labor-intensive and time consuming effort of labeling traini...
121
click to vote
CLOUDCOM
2010
Springer
15 years 1 months ago
2010
Springer
This paper investigates the problem of Partitioning Skew1 in MapReduce-based system. Our studies with Hadoop, a widely used MapReduce implementation, demonstrate that the presence ...
129
click to vote
SIGIR
2008
ACM
15 years 4 months ago
2008
ACM
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
236
click to vote
ICDE
1998
IEEE
16 years 5 months ago
1998
IEEE
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...