Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,115,615 papers from all fields of science
Search
Sign In
Create Free Account
Bit array
Known as:
Boolean array
, Bit string
, Bitvector
Expand
A bit array (also known as bitmap, bitset, bit string, or bit vector) is an array data structure that compactly stores bits. It can be used to…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
APL
Arithmetic logic unit
Array data structure
Binary data
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Design and management of flexible process variants using templates and rules
Akhil Kumar
,
W. Yao
Computers in industry (Print)
2012
Corpus ID: 18716364
Highly Cited
2012
Highly Cited
2012
DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets
Bay Vo
,
Tzung-Pei Hong
,
H. Le
Expert systems with applications
2012
Corpus ID: 16443219
Highly Cited
2005
Highly Cited
2005
A Nonlinear Dynamics Perspective of Wolfram's New Kind of Science Part IV: from Bernoulli Shift to 1/F Spectrum
L. Chua
,
V. I. Sbitnev
,
Sook Yoon
International Journal of Bifurcation and Chaos in…
2005
Corpus ID: 14866747
By exploiting the new concepts of CA characteristic functions and their associated attractor time-τ maps, a complete…
Expand
Highly Cited
2004
Highly Cited
2004
Threading Software Watermarks
J. Nagra
,
C. Thomborson
Information Hiding
2004
Corpus ID: 52849341
We introduce a new dynamic technique for embedding robust software watermarks into a software program using thread contention. We…
Expand
2003
2003
HMM-based channel error mitigation and its application to distributed speech recognition
A. Peinado
,
V. Sánchez
,
J. L. Pérez-Córdoba
,
Á. D. L. Torre
Speech Communication
2003
Corpus ID: 2833796
1996
1996
Randomness-optimal sampling, extractors, and constructive leader election
David Zuckerman
Symposium on the Theory of Computing
1996
Corpus ID: 15919399
We present the first efficient universal oblivious sampler that uses an optimal number of random bits, up to an arbitrary…
Expand
Highly Cited
1996
Highly Cited
1996
Shape Representations and Evolution Schemes
Marc Schoenauer
Evolutionary Programming
1996
Corpus ID: 11832375
The choice of a representation i.e. the deeni-tion of the search space, is of vital importance in all Evolutionary Optimization…
Expand
Highly Cited
1991
Highly Cited
1991
CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks
S. Soh
,
S. Rai
IEEE Trans. Parallel Distributed Syst.
1991
Corpus ID: 1132635
An efficient method to compute the terminal reliability (the probability of communication between a pair of nodes) of a…
Expand
Highly Cited
1989
Highly Cited
1989
Emulating the dynamics for a class of laterally inhibited neural networks
M. Lemmon
,
B. Kumar
Neural Networks
1989
Corpus ID: 4381996
Highly Cited
1988
Highly Cited
1988
The structure of the limit cycles in sigma delta modulation
V. Friedman
IEEE Transactions on Communications
1988
Corpus ID: 28804295
It is shown that when the input to a sigma-delta modulator is a DC level that can be expressed as a rational number b/a, when…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE