1951 search results - page 74 / 391 » An algorithm for improving graph partitions |
186
Voted
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
150
click to vote
WWW
2008
ACM
16 years 6 months ago
2008
ACM
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...
180
click to vote
ORDER
2008
15 years 6 months ago
2008
Given a poset P = (X, ), a partition X1, . . . , Xk of X is called an ordered partition of P if, whenever x Xi and y Xj with x y, then i j. In this paper, we show that for ever...
145
click to vote
DCOSS
2007
Springer
16 years 8 days ago
2007
Springer
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
149
click to vote
GLVLSI
2006
IEEE
16 years 4 days ago
2006
IEEE
Most of the logic synthesis algorithms are not scalable for large networks and, for this reason, partitioning is often applied. However traditional mincut-based partitioning techn...