Sciweavers

522 search results - page 8 / 105
» Energy Models for Graph Clustering
Sort
View
ICML
2005
IEEE
15 years 10 months ago
Error bounds for correlation clustering
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
Thorsten Joachims, John E. Hopcroft
CVPR
2008
IEEE
15 years 11 months ago
Interactive image segmentation via minimization of quadratic energies on directed graphs
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
Dheeraj Singaraju, Leo Grady, René Vidal
CASES
2010
ACM
14 years 6 months ago
Optimizing energy to minimize errors in dataflow graphs using approximate adders
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna ...
80
Voted
VTC
2007
IEEE
15 years 3 months ago
Energy-Optimized Low-Complexity Control of Power and Rate in Clustered CDMA Sensor Networks with Multirate Constraints
—In this paper, we propose a low-complexity scheme for minimizing energy consumption in a clustered multirate CDMA sensor network with multiple receive antennas by jointly contro...
Chun-Hung Liu
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
15 years 2 months ago
Modeling the Search Landscape of Metaheuristic Software Clustering Algorithms
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
Brian S. Mitchell, Spiros Mancoridis