5 search results - page 1 / 1 » CONCISE: Compressed 'n' Composable Integer Set |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
CANS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
ECCC
2007
13 years 4 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
SWAT
2010
Springer
13 years 10 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
IFIPTCS
2000
13 years 8 months ago
2000
Masaccio is a formal model for hybrid dynamical systems which are built from atomic discrete components (di erence equations) and atomic continuous components (di erential equation...