4714 search results - page 360 / 943 » The Complexity of Iterated Multiplication |
192
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We propose an approach to lossy source coding, utilizing ideas from Gibbs sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is to sample a reconstructio...
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility func...
179
click to vote
CN
2007
15 years 6 months ago
2007
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
232
click to vote
ADBIS
2009
Springer
15 years 11 months ago
2009
Springer
Scaling up web applications requires distribution of load across multiple application servers and across multiple database servers. Distributing load across multiple application se...
169
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...