Sciweavers

543 search results - page 72 / 109
» New Upper Bounds for MaxSat
Sort
View
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...
ASIACRYPT
2007
Springer
15 years 3 months ago
Secure Protocols with Asymmetric Trust
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...
Ivan Damgård, Yvo Desmedt, Matthias Fitzi, J...
APPROX
2008
Springer
173views Algorithms» more  APPROX 2008»
14 years 11 months ago
Connected Vertex Covers in Dense Graphs
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
Jean Cardinal, Eythan Levy
CCCG
2003
14 years 11 months ago
The Gaussian Centre of a Set of Mobile Points
Abstract Steph Durocher∗ and David Kirkpatrick† Department of Computer Science, University of British Columbia Vancouver BC, Canada Given a set of client positions as input, f...
Stephane Durocher, David G. Kirkpatrick
CORR
2007
Springer
149views Education» more  CORR 2007»
14 years 9 months ago
Graph Entropy, Network Coding and Guessing games
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
Søren Riis