3898 search results - page 254 / 780 » On the Bit Extraction Problem |
134
Voted
ICDCS
2009
IEEE
16 years 17 days ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
122
Voted
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
—The error floor of bit-interleaved coded modulation with iterative decoding (BICM-ID) can be minimized for a particular constellation by maximizing the harmonic mean of the squ...
135
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— A systematic approach to solve seemingly nonconvex resource allocation problems in wireless cellular networks is studied in this paper. By revealing and exploiting the hidden c...
151
Voted
INDOCRYPT
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. For elliptic curve based cryptosystems, the discrete logarithm problem must be hard to solve. But even when this is true from a mathematical point of view, side-channel a...
128
click to vote
PODC
2005
ACM
15 years 9 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...