3898 search results - page 23 / 780 » On the Bit Extraction Problem |
SPAA
2010
ACM
14 years 10 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
APCCAS
2006
IEEE
15 years 3 months ago
2006
IEEE
— The DCT-based JPEG standard is certainly one of the most successful applications of transform coding methods for still digital images. A commonly recognized disadvantage of the...
LATA
2009
Springer
15 years 2 months ago
2009
Springer
Many algorithms, e.g. in the field of string matching, are based on handling many counters, which can be performed in parallel, even on a sequential machine, using bit-parallelism...
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...