1951 search results - page 144 / 391 » An algorithm for improving graph partitions |
120
click to vote
GD
2003
Springer
15 years 9 months ago
2003
Springer
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
168
Voted
SMI
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we propose a new algorithm for the fundamental problem of reconstructing surfaces from a large set of unorganized 3D data points. The local shapes of the surface ar...
143
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, Border algorithm...
136
click to vote
PRL
2008
15 years 4 months ago
2008
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
127
Voted
FLAIRS
2007
15 years 7 months ago
2007
In this paper, we focus on the ontological concept extraction and evaluation process from HTML documents. In order to improve this process, we propose an unsupervised hierarchical...