136 search results - page 11 / 28 » Experimental Study of Minimum Cut Algorithms |
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Energy-efficient broadcast communication is an important problem in wireless ad hoc networks. Previously, minimum-energy broadcast that exploits the broadcast nature of radio ...
101
click to vote
EDBT
2012
ACM
13 years 2 days 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...
64
Voted
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
This paper introduces two new algorithms to reduce the number of objectives in a multiobjective problem by identifying the most conflicting objectives. The proposed algorithms ar...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
ISVLSI
2008
IEEE
15 years 4 months ago
2008
IEEE
In high-performance VLSI circuits, the on-chip power densities are playing dominant role due to increased scaling of technology, increasing number of components, frequency and ban...