Functions realizable with word-parallel logical and two's-complement addition instructions
Communications of the ACM
Comments on a technique for counting ones
Communications of the ACM
Combinatorial sketching for finite programs
Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
Inferring Congruence Equations Using SAT
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Concise: Compressed 'n' Composable Integer Set
Information Processing Letters
Self-taught hashing for fast similarity search
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
A generalized-zero-preserving method for compact encoding of concept lattices
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Error-correcting output hashing in fast similarity search
ICIMCS '10 Proceedings of the Second International Conference on Internet Multimedia Computing and Service
Probabilistic near-duplicate detection using simhash
Proceedings of the 20th ACM international conference on Information and knowledge management
Mid-level segmentation and segment tracking for long-range stereo analysis
PSIVT'11 Proceedings of the 5th Pacific Rim conference on Advances in Image and Video Technology - Volume Part I
Evaluation of a new coarse-to-fine strategy for fast semi-global stereo matching
PSIVT'11 Proceedings of the 5th Pacific Rim conference on Advances in Image and Video Technology - Volume Part I
WHAM: A High-Throughput Sequence Alignment Method
ACM Transactions on Database Systems (TODS)
Semi-supervised spectral hashing for fast similarity search
Neurocomputing
Hi-index | 48.25 |
Standard methods of counting binary ones on a computer with a 704 type instruction code require an inner loop which is carried out once for each bit in the machine word. Program 1 (written in SAP language for purposes of illustration) is an example of such a standard program.