10901 search results - page 366 / 2181 » Approximations in Distributed Optimization |
189
click to vote
PAMI
2002
15 years 7 months ago
2002
We propose a method for choosing the number of colors or true gray levels in an image; this allows fully automatic segmentation of images. Our underlying probability model is a hid...
235
Voted
MOBIHOC
2002
ACM
16 years 7 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
215
click to vote
SC
2003
ACM
16 years 21 days ago
2003
ACM
We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. W...
208
Voted
JCM
2008
15 years 7 months ago
2008
An analytical model is developed to solve the power-rate assignment problem for multi-rate CDMA systems and calculate the probability density function (PDF) for the downlink traffi...
196
click to vote
NETWORKS
2006
15 years 7 months ago
2006
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...