3898 search results - page 170 / 780 » On the Bit Extraction Problem |
81
Voted
STACS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We consider the problem of representing, in a compressed format, a bitvector S of m bits with n 1s, supporting the following operations, where b ∈ {0, 1}:
112
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
123
click to vote
EUROCRYPT
2006
Springer
15 years 6 months ago
2006
Springer
We show that oblivious transfer of bits from A to B can be obtained from a single instance of the same primitive from B to A. Our reduction is perfect and shows that oblivious tran...
DCC
2006
IEEE
16 years 2 months ago
2006
IEEE
We consider the problem of compressibility of protein sequences. Based on an observed genome-scale long-range correlation in concatenated protein sequences from different organism...
110
click to vote
SODA
2010
ACM
16 years 6 days ago
2010
ACM
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...