10901 search results - page 290 / 2181 » Approximations in Distributed Optimization |
176
click to vote
MLDM
2008
Springer
15 years 6 months ago
2008
Springer
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
155
click to vote
TCOM
2008
15 years 6 months ago
2008
The cumulative distribution function (cdf) of a sum of correlated or even independent lognormal random variables (RVs), which is of wide interest in wireless communications, remain...
183
click to vote
FTDB
2011
14 years 10 months ago
2011
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...
182
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
154
click to vote
ISAAC
2005
Springer
16 years 5 days ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...