Sciweavers

1541 search results - page 185 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
PIMRC
2010
IEEE
13 years 6 months ago
Asymptotic analysis of distributed multi-cell beamforming
We consider the problem of multi-cell downlink beamforming with N cells and K terminals per cell. Cooperation among base stations (BSs) has been found to increase the system throug...
Subhash Lakshminaryana, Jakob Hoydis, Mérou...
STACS
2005
Springer
14 years 1 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning
ECCC
2010
80views more  ECCC 2010»
13 years 8 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
CVPR
2012
IEEE
11 years 10 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
MST
2006
136views more  MST 2006»
13 years 8 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl