4009 search results - page 115 / 802 » Clustering on Complex Graphs |
144
click to vote
COR
2007
15 years 3 months ago
2007
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Max...
137
Voted
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
128
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
113
click to vote
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract—This work focuses on the scalability of the Evidence Accumulation Clustering (EAC) method. We first address the space complexity of the co-association matrix. The spars...
149
click to vote
AINA
2004
IEEE
15 years 7 months ago
2004
IEEE
Efficient computing the PageRank scores for a large web graph is actually one of the hot issues in Web-IR community. Recent researches propose to accelerate the computation, both ...