Sciweavers

5595 search results - page 196 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
145
Voted
IPPS
2010
IEEE
15 years 4 months ago
Large-scale multi-dimensional document clustering on GPU clusters
Document clustering plays an important role in data mining systems. Recently, a flocking-based document clustering algorithm has been proposed to solve the problem through simulat...
Yongpeng Zhang, Frank Mueller, Xiaohui Cui, Thomas...
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
15 years 6 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...
150
Voted
WG
2007
Springer
16 years 7 days ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
146
Voted
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
16 years 9 days ago
An improved restricted growth function genetic algorithm for the consensus clustering of retinal nerve fibre data
This paper describes an extension to the Restricted Growth Function grouping Genetic Algorithm applied to the Consensus Clustering of a retinal nerve fibre layer data-set. Consens...
Stephen Swift, Allan Tucker, Jason Crampton, David...
132
Voted
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
16 years 8 days ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar