Skip to search formSkip to main contentSkip to account menu

Bit array

Known as: Boolean array, Bit string, Bitvector 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
APLArithmetic logic unitArray data structureBinary data

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
2010
2010
Robust minutiae hash for fingerprint template protection
A robust fingerprint minutiae hash generation algorithm is proposed in this paper to extract a binary secure hash bit string from… 
Highly Cited
2010
Highly Cited
2010
SPACE: Sharing pattern-based directory coherence for multicore scalability
An important challenge in multicore processors is the maintenance of cache coherence in a scalable manner. Directory-based… 
2009
2009
Un-Trusted-HB: Security Vulnerabilities of Trusted-HB
With increased use of passive RFID tags, the need for secure lightweight identification protocols arose. HB+ is one such protocol… 
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
By exploiting the new concepts of CA characteristic functions and their associated attractor time-τ maps, a complete… 
2003
2003
HMM-based channel error mitigation and its application to distributed speech recognition
Highly Cited
2001
Highly Cited
2001
Notes on design and implementation of compressed bit vectors
Author(s): Wu, Kesheng | Abstract: Many database applications make extensive use of bitmap indexing schemes. In this paper, we… 
Highly Cited
1996
Highly Cited
1996
Shape Representations and Evolution Schemes
The choice of a representation i.e. the deeni-tion of the search space, is of vital importance in all Evolutionary Optimization… 
Highly Cited
1991
Highly Cited
1991
CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks
  • S. SohS. 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… 
Highly Cited
1988
Highly Cited
1988
The structure of the limit cycles in sigma delta modulation
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… 
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)