Sciweavers

5580 search results - page 171 / 1116
» Randomized priority algorithms
Sort
View
VTC
2008
IEEE
156views Communications» more  VTC 2008»
15 years 4 months ago
Channel Asymmetry and Random Time Slot Hopping in OFDMA-TDD Cellular Networks
Abstract—This paper studies the performance of orthogonal frequency division multiple access – time division duplex (OFDMA-TDD) cellular networks when jointly applying dynamic ...
Ellina Foutekova, Patrick Agyapong, Harald Haas
ISCAPDCS
2004
14 years 11 months ago
Randomized Sorting on the POPS Network
Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamen...
Jaime Davila, Sanguthevar Rajasekaran
PAMI
2008
198views more  PAMI 2008»
14 years 10 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 5 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
83
Voted
ENTCS
2007
108views more  ENTCS 2007»
14 years 10 months ago
Simulating and Compiling Code for the Sequential Quantum Random Access Machine
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
Rajagopal Nagarajan, Nikolaos Papanikolaou, David ...