3898 search results - page 344 / 780 » On the Bit Extraction Problem |
159
click to vote
ESA
1993
Springer
15 years 8 months ago
1993
Springer
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
138
click to vote
ICALP
1992
Springer
15 years 8 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
146
click to vote
STOC
1994
ACM
15 years 8 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
134
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
135
click to vote
CAV
2010
Springer
15 years 8 months ago
2010
Springer
For efficiency and portability, network packet processing code is typically written in low-level languages and makes use of bit-level operations to compactly represent data. Althou...