961 search results - page 65 / 193 » Significance-Driven Graph Clustering |
152
click to vote
COR
2007
15 years 4 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...
152
click to vote
AINA
2004
IEEE
15 years 8 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 ...
148
click to vote
FPL
2008
Springer
15 years 5 months ago
2008
Springer
This paper presents a new approach for mapping task graphs to heterogeneous hardware/software computing systems using heuristic search techniques. Two techniques: (1) integration ...
128
Voted
IAT
2006
IEEE
15 years 10 months ago
2006
IEEE
Unstructured P2P networks can grow in an ad-hoc and give rise to scale-free graphs where most of the nodes form clusters or hubs around few resourceful nodes. This leads to conges...
122
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...