10901 search results - page 67 / 2181 » Approximations in Distributed Optimization |
188
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We propose an approximate Bayesian approach for unsupervised feature selection and density estimation, where the importance of the features for clustering is used as the measure f...
163
click to vote
INFOCOM
2007
IEEE
16 years 14 days ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
184
click to vote
PPSN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Evolution Strategies, Evolutionary Algorithms based on Gaussian mutation and deterministic selection, are today considered the best choice as far as parameter optimizatio...
132
click to vote
IH
2009
Springer
16 years 21 days ago
2009
Springer
This paper is concerned with the estimation of steganographic capacity in digital images, using information theoretic bounds and very large-scale experiments to approximate the dis...
192
click to vote
KDD
2009
ACM
16 years 6 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...