Sciweavers

1161 search results - page 115 / 233
» Approximation schemes for clustering problems
Sort
View
VTC
2007
IEEE
14 years 4 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
CVPR
2006
IEEE
15 years 3 days ago
Model Order Selection and Cue Combination for Image Segmentation
Model order selection and cue combination are both difficult open problems in the area of clustering. In this work we build upon stability-based approaches to develop a new method...
Andrew Rabinovich, Serge Belongie, Tilman Lange, J...
CISS
2008
IEEE
14 years 4 months ago
Subgradient methods in network resource allocation: Rate analysis
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Angelia Nedic, Asuman E. Ozdaglar
EOR
2006
90views more  EOR 2006»
13 years 10 months ago
A parallelizable dynamic fleet management model with random travel times
In this paper, we present a stochastic model for the dynamic fleet management problem with random travel times. Our approach decomposes the problem into time-staged subproblems by...
Huseyin Topaloglu
BMCBI
2011
13 years 1 months ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto