1124 search results - page 93 / 225 » Constructing Common Information Spaces |
129
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
311
click to vote
ICDE
2009
IEEE
17 years 4 months ago
2009
IEEE
Context is any information used to characterize the situation of an entity. Examples of contexts includetime, location, identity, and activity of a user. This paper proposes a gene...
140
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
217
click to vote
PKC
2011
Springer
14 years 7 months ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
119
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
—We consider a multiuser two-way relay network where multiple pairs of users communicate with their pre-assigned partners, using a common intermediate relay node, in a twophase c...