Sciweavers

679 search results - page 12 / 136
» A System for Graph Clustering Based on User Hints
Sort
View
IWMMDBMS
1998
123views more  IWMMDBMS 1998»
15 years 1 months ago
An Adaptive Block Management Scheme Using On-Line Detection of Block Reference Patterns
Recent research has shown that near optimal performance can be achieved by adaptive block replacement policies that use user-level hints regarding the block reference pattern. How...
Jongmoo Choi, Sam H. Noh, Sang Lyul Min, Yookun Ch...
AI
2009
Springer
15 years 6 months ago
Exploratory Analysis of Co-Change Graphs for Code Refactoring
Abstract. Version Control Systems (VCS) have always played an essential role for developing reliable software. Recently, many new ways of utilizing the information hidden in VCS ha...
Hassan Khosravi, Recep Colak
GD
2004
Springer
15 years 5 months ago
Clustering Cycles into Cycles of Clusters
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
Pier Francesco Cortese, Giuseppe Di Battista, Maur...
CASCON
1992
134views Education» more  CASCON 1992»
15 years 26 days ago
Cluster busting in anchored graph drawing
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
Kelly A. Lyons
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
14 years 10 months ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...