Sciweavers

638 search results - page 27 / 128
» Track Layouts of Graphs
Sort
View
AAAI
2008
15 years 3 months ago
Visualization of Large-Scale Weighted Clustered Graph: A Genetic Approach
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...
Jiayu Zhou, Youfang Lin, Xi Wang
125
Voted
FAW
2010
Springer
232views Algorithms» more  FAW 2010»
15 years 2 months ago
Recognizing d-Interval Graphs and d-Track Interval Graphs
A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval...
Minghui Jiang
USENIX
2007
15 years 3 months ago
DiskSeen: Exploiting Disk Layout and Access History to Enhance I/O Prefetch
Current disk prefetch policies in major operating systems track access patterns at the level of the file abstraction. While this is useful for exploiting application-level access...
Xiaoning Ding, Song Jiang, Feng Chen, Kei Davis, X...
BMCBI
2007
265views more  BMCBI 2007»
15 years 1 months ago
Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
Tobias Wittkop, Jan Baumbach, Francisco P. Lobo, S...
IJON
2010
94views more  IJON 2010»
15 years 1 days ago
Optimizing an organized modularity measure for topographic graph clustering: A deterministic annealing approach
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...
Fabrice Rossi, Nathalie Villa-Vialaneix