Results 251 to 260 of about 731,305 (291)
Some of the next articles are maybe not open access.
Annotation-Efficient Cell Counting
2021Recent advances in deep learning have achieved impressive results on microscopy cell counting tasks. The success of deep learning models usually needs sufficient training data with manual annotations, which can be time-consuming and costly. In this paper, we propose an annotation-efficient cell counting approach which injects cell counting networks ...
Zuhui Wang, Zhaozheng Yin
openaire +1 more source
Efficiency of Counting Systems
Proceedings of the Physical Society, 1948A review is made of the derivation of formulae for the efficiency of counting systems, comprising in the general case a counter and amplifier, a scaling circuit and a recorder. In the case of recorders of constant resolving time no complete formula has been found in the literature, and this has been derived.
Blackman, M., Michiels, J. L.
openaire +2 more sources
Increasing the Efficiency of Bit-Counting
International Journal of Computers and Applications, 2007The 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 +3 more
openaire +1 more source
Counting RFID Tags Efficiently and Anonymously
2010 Proceedings IEEE INFOCOM, 2010Radio Frequency IDentification (RFID) technology has attracted much attention due to its variety of applications, e.g., inventory control and object tracking. One important problem in RFID systems is how to quickly estimate the number of distinct tags without reading each tag individually.
Hao Han +5 more
openaire +1 more source
An efficient filling algorithm for counting regions
Computer Methods and Programs in Biomedicine, 2004Region 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. +2 more
openaire +5 more sources
Efficient techniques for k-mer counting
2015 IEEE 5th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS), 2015A large number of bioinformatics applications require counting of k-length substrings in genetically important long strings. K-mer counting generates the frequencies of each k-length substring in genome sequences. Genome assembly, repeat detection, multiple sequence alignment, error detection, and many other related applications use k-mer counting as a
Abdullah-Al Mamun 0002 +2 more
openaire +1 more source
Efficient temporal counting with bounded error
The VLDB Journal, 2007This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its search key, and its x-projection represents the period when the key was valid in history.
Yufei Tao 0001, Xiaokui Xiao
openaire +1 more source
Transmission efficiency in photon counting channels
IEEE Transactions on Communications, 1989An investigation is presented of the maximum transmission efficiency that can be reached over an ideal photon counting channel, having fixed the bandwidth expansion factor. First, the ideal situation, represented by C.E. Shannon's (1959) theorem for discrete channels, is analyzed.
openaire +1 more source
An efficient procedure for manual platelet counting
Veterinary Record, 1989Blood 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 +3 more
openaire +2 more sources
Efficient Colored Orthogonal Range Counting
SIAM Journal on Computing, 2008Let $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 +3 more
openaire +1 more source