Sciweavers

134 search results - page 19 / 27
» A New Tight Upper Bound on the Transposition Distance
Sort
View
COCO
2004
Springer
156views Algorithms» more  COCO 2004»
15 years 3 months ago
Multiparty Quantum Coin Flipping
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: • We propose and motivate a definition for quantum broadcast. Our model of quantum ...
Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, He...
RECOMB
1997
Springer
15 years 1 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
SODA
2001
ACM
115views Algorithms» more  SODA 2001»
14 years 11 months ago
Loss-bounded analysis for differentiated services
We consider a network providing Differentiated Services (DiffServ) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic...
Alexander Kesselman, Yishay Mansour
ESA
2009
Springer
130views Algorithms» more  ESA 2009»
15 years 4 months ago
On the Performance of Approximate Equilibria in Congestion Games
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
George Christodoulou, Elias Koutsoupias, Paul G. S...
ICASSP
2011
IEEE
14 years 1 months ago
On the sum rate of ZF detectors over correlated K fading MIMO channels
This paper presents a detailed sum rate investigation of Zero-Forcing (ZF) detectors over composite multiple-input multiple-output (MIMO) channels. To this end, we consider the ge...
Michail Matthaiou, Nestor D. Chatzidiamantis, Geor...