Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
In this paper, we propose a new deep hashing (DH) approach to learn compact binary codes for large scale visual search. Unlike… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
After several years of theoretical research on distance bounding protocols, the first implementations of such protocols have… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Nearly all of the currently used and well-tested signature schemes (e.g. RSA or DSA) are based either on the factoring assumption… Expand
  • table 1
  • figure 3
  • figure 4
  • table 2
  • table 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
It has become critical to protect biometric templates in the current biometric community. One way for doing this is using a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover… Expand
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
SummaryA “plant gene vector cassette” to be used in combination with various Escherichia coli gene-cloning vectors was… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We outline cryptographic key-computation from biometric data based on error-tolerant transformation of continuous-valued face… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
  • Thomas Kropf
  • Springer Berlin Heidelberg
  • 1999
  • Corpus ID: 40832620
Introduction.- Boolean Functions.- Finite State Machine Based Approaches.- Propositional Temporal Logics.- Higher Order Logic… Expand
  • figure 1-1
  • figure 1-2
  • figure 1-3
  • figure 1-4
  • table 1-1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
With the growth of interest in database searching and compound selection, the quantification of chemical similarity has become an… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Blowfish, a new secret-key block cipher, is proposed. It is a Feistel network, iterating a simple encryption function 16 times… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?