Results 151 to 160 of about 726,653 (188)

Increasing the Efficiency of Bit-Counting

International Journal of Computers and Applications, 2007
The operation of bit-counting, that is, determining the number of "1's" in a string of bits, is of significant importance for a number of computer applications such as coding theory, information retrieval, genetic algorithms, and file comparison. The growing importance of this operation has led to inclusion in recent computer systems of "popcount ...
E. El-Qawasmeh, M. Strauss, M. Mack, S. Berkovich   +3 more
openaire   +1 more source

Factors Affecting the Counting Efficiency

2021
In the previous chapter, we realized the importance of source preparation for getting meaningful results. However, in addition to source preparation, there are many other factors, like geometrical factors, scattering of radiation, selection of radiation emitted by the isotope etc., that also need to be considered for measuring the activity of the ...
Maheshwar Sharon, Madhuri Sharon
openaire   +1 more source

Efficiently estimated histologic cell counts

Human Pathology, 1994
Three different estimates were compared with complete nuclear counts made over 200 fields (20 sets of 10) selected from histologic sections of 18 breast carcinomas. All counting used a 10 x 10 square grid eyepiece graticule at x 400. Two area sampling techniques agreed well with overall counts (59,210 cells counted in all 200 fields; estimates were 58 ...
openaire   +2 more sources

Efficient Colored Orthogonal Range Counting

SIAM Journal on Computing, 2008
Let $P$ be a set of $n$ points in $\mathbb{R}^d$, so that each point is colored by one of $C$ given colors. We present algorithms for preprocessing $P$ into a data structure that efficiently supports queries of the following form: Given an axis-parallel box $Q$, count the number of distinct colors of the points of $P\cap Q$.
Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin   +3 more
openaire   +1 more source

CHEREN, the Cherenkov counting efficiency

Computer Physics Communications, 1998
Abstract A program is presented that computes the Cherenkov counting efficiency for β -particle-emitting nuclides counted in commercial liquid-scintillation spectrometers. The detection probability function for the Cherenkov light is derived experimentally for standards of 36 C1 and 32 P, and integrated over the energy interval between the ...
Grau Carles, A., Grau Malonda, A.
openaire   +2 more sources

EPiC: efficient privacy-preserving counting for MapReduce

Computing, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vo-Huu, Triet Dang, Blass, Erik-Oliver, Noubir, Guevara   +2 more
openaire   +1 more source

Efficient counting network

1998
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar to that of sorting networks. High-performance asynchronous multiprocessing requires counting networks to both have small depth and incur low contention.
Busch, Costas, Mavronicolas, Marios, Busch, Costas, Mavronicolas, Marios   +3 more
openaire   +1 more source

An efficient procedure for manual platelet counting

Veterinary Record, 1989
Blood samples were collected by jugular venipuncture from 15 dairy heifers and the blood platelets were counted by manual methods. The platelets were found to be uniformly distributed across the rows, columns and sides of a Neubauer haemocytometer, and it was shown that counting any 10 squares on either side of the haemocytometer and multiplying by a ...
J K, Thibodeaux, J D, Roussel, R W, Adkinson, L L, Goodeaux   +3 more
openaire   +2 more sources

Efficient cyclic weighted reference counting

14th Symposium on Computer Architecture and High Performance Computing, 2002. Proceedings., 2003
Weighted reference counting is a very simple and efficient memory management system for multiprocessor architectures. This paper extends the weighted reference counting algorithm to work efficiently with cyclic data structures.
openaire   +1 more source

An efficient filling algorithm for counting regions

Computer Methods and Programs in Biomedicine, 2004
Region filling has many applications in computer graphics and image analysis. Some region filling tasks can be performed by fast scan line filling algorithms. Other region filling tasks require seed filling algorithms which are more general but slower.
Geraets, W.G.M., van Daatselaar, A.N., Verheij, H.G.C.   +2 more
openaire   +4 more sources