6437 search results - page 206 / 1288 » Parallel Algorithms for Arrangements |
140
click to vote
AE
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
126
click to vote
MVA
1992
15 years 4 months ago
1992
We present a new algorithm for topological feature mapping. It is compared to other known feature mapping algorithmslike that proposed by Kohonen or Bertsch. The main difference t...
122
click to vote
FUIN
2006
15 years 3 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
114
click to vote
IJDMB
2007
15 years 3 months ago
2007
: The increasing availability of protein-protein interaction graphs (PPI) requires new efficient tools capable of extracting valuable biological knowledge from these networks. Amon...
148
click to vote
EUROPAR
2004
Springer
15 years 6 months ago
2004
Springer
Hierarchical agglomerative clustering (HAC) is a common clustering method that outputs a dendrogram showing all N levels of agglomerations where N is the number of objects in the d...