1093 search results - page 14 / 219 » Clustering from Constraint Graphs |
104
click to vote
SDM
2008
SIAM
15 years 1 months ago
2008
SIAM
In this paper, we present a measure associated with detection and inference of statistically anomalous clusters of a graph based on the likelihood test of observed and expected ed...
100
click to vote
IWPC
2000
IEEE
15 years 4 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
108
click to vote
BMCBI
2011
14 years 6 months ago
2011
Background: The number of gene sequences that are available for comparative genomics approaches is increasing extremely quickly. A current challenge is to be able to handle this h...
112
Voted
EDBT
2012
ACM
13 years 2 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
82
Voted
CASCON
1993
15 years 1 months ago
1993
When debugging a distributed application, a display showing the events causing interactions between processes can be very useful. If the number of processes is large, displaying a...