78 search results - page 11 / 16 » Randomized Methods for Linear Constraints: Convergence Rates... |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
ATAL
2003
Springer
14 years 23 days ago
2003
Springer
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literat...
NOMS
2008
IEEE
14 years 1 months ago
2008
IEEE
—In this paper∗ , we devise a novel method for bottleneck analysis of UDP networks based on the concept of network utility maximization. To determine the losses on the links in...