2924 search results - page 275 / 585 » Lower Bounds in Distributed Computing |
143
click to vote
MP
2007
15 years 3 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
140
Voted
IJACTAICIT
2010
15 years 1 months ago
2010
This paper presents an improved adaptive algorithm for enhanced data hiding under HH-subband Haar Wavelet coefficients of a gray scale host image. The algorithm uses an optimal se...
127
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We investigate in this paper the anchor selection problem with consideration of anchor location uncertainty, which arises naturally from error propagation problem in successive or...
169
click to vote
JMLR
2012
13 years 6 months ago
2012
This paper proposes a novel Bayesian approximation inference method for mixture modeling. Our key idea is to factorize marginal log-likelihood using a variational distribution ove...
79
Voted
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...