961 search results - page 94 / 193 » Significance-Driven Graph Clustering |
235
click to vote
ICPP
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper presents a parallel external-memory algorithm for performing a breadth-first traversal of an implicit graph on a cluster of workstations. The algorithm is a paralle...
131
click to vote
WISE
2002
Springer
15 years 9 months ago
2002
Springer
Delta compression techniques are commonly used to succinctly represent an updated version of a file with respect to an earlier one. In this paper, we study the use of delta compr...
126
click to vote
ASWEC
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper presents the framework of a scale-oriented scheme for the presentation and classification of reverse engineered sections of procedural code into objects. The aim is to ...
228
click to vote
ACID
2006
15 years 5 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
131
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...