Relevant bibliographies by topics / Count-algorithm

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Count-algorithm'

Author: Grafiati
Published: 4 June 2021
Last updated: 13 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Count-algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Count-algorithm"

1

Swarnkar, Mayank. "Count based Secured Hash Algorithm." IOSR Journal of Computer Engineering 6, no. 6 (2012): 49–51. http://dx.doi.org/10.9790/0661-0664951.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gosset, David, Vadym Kliuchnikov, Michele Mosca, and Vincent Russo. "An algorithm for the T-countAn algorithm for the T-count." Quantum Information and Computation 14, no. 15&16 (November 2014): 1261–76. http://dx.doi.org/10.26421/qic14.15-16-1.

Full text
Abstract:
We consider quantum circuits composed of Clifford and $T$ gates. In this context the $T$ gate has a special status since it confers universal computation when added to the (classically simulable) Clifford gates. However it can be very expensive to implement fault-tolerantly. We therefore view this gate as a resource which should be used only when necessary. Given an $n$-qubit unitary $U$ we are interested in computing a circuit that implements it using the minimum possible number of $T$ gates (called the $T$-count of $U$). A related task is to decide if the $T$-count of $U$ is less than or equal to $m$; we consider this problem as a function of $N=2^n$ and $m$. We provide a classical algorithm which solves it using time and space both upper bounded as $\mathcal{O}(N^m \text{poly}(m,N))$. We implemented our algorithm and used it to show that any Clifford+T circuit for the Toffoli or the Fredkin gate requires at least 7 $T$ gates. This implies that the known 7 $T$ gate circuits for these gates are $T$-optimal. We also provide a simple expression for the $T$-count of single-qubit unitaries.
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Haining, and Huanbo Gao. "Large Crowd Count Based on Improved SURF Algorithm." TELKOMNIKA (Telecommunication Computing Electronics and Control) 12, no. 4 (December 1, 2014): 865. http://dx.doi.org/10.12928/telkomnika.v12i4.362.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

McLachlan, G. J. "On the EM algorithm for overdispersed count data." Statistical Methods in Medical Research 6, no. 1 (February 1997): 76–98. http://dx.doi.org/10.1177/096228029700600106.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

McLachlan, G. "On the EM algorithm for overdispersed count data." Statistical Methods in Medical Research 6, no. 1 (January 1, 1997): 76–98. http://dx.doi.org/10.1191/096228097666670466.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yusifli, Elmar, Reda Yahiaoui, Isabelle Lajoie, and Salahaddin Yusifov. "Embedded Cell Count Algorithm for Cultured Tissue Characterization." IFAC-PapersOnLine 51, no. 30 (2018): 683–87. http://dx.doi.org/10.1016/j.ifacol.2018.11.221.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Arandjelović, V. Dj, A. M. Koturović, and R. B. Vukanović. "Preset count moving average digital algorithm with faster response to an increasing count rate." Review of Scientific Instruments 70, no. 9 (September 1999): 3765–69. http://dx.doi.org/10.1063/1.1149990.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Freire, Paulo C. C., and Alessandro Ridolfi. "An algorithm for determining the rotation count of pulsars." Monthly Notices of the Royal Astronomical Society 476, no. 4 (February 27, 2018): 4794–805. http://dx.doi.org/10.1093/mnras/sty524.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Klinger-Strobel, Mareike, Herbert Suesse, Dagmar Fischer, Mathias W. Pletz, and Oliwia Makarewicz. "A Novel Computerized Cell Count Algorithm for Biofilm Analysis." PLOS ONE 11, no. 5 (May 5, 2016): e0154937. http://dx.doi.org/10.1371/journal.pone.0154937.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Arandjelovic, Vojislav, and Ðordje Saponjic. "The error estimate for the modified preset count ratemeter algorithm." Facta universitatis - series: Electronics and Energetics 18, no. 3 (2005): 421–29. http://dx.doi.org/10.2298/fuee0503421a.

Full text
Abstract:
Analogously to the traditional preset count rate meter algorithm, the error estimate of the modified preset count ratemeter algorithm has been defined as the range around measured mean count rate containing 2/3 of the measurement results. The coefficients determining this range have been calculated for a set of values of the modification parameter (m) and preset count (NT). The calculations cover the ranges of these parameters which are of practical interest (m 0 25 1 5 NT 12 150). By applying the piecewise-linear interpolation scheme it is possible to calculate measurement error for any pair m NT within the ranges of these parameters covered by the present calculations.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Count-algorithm"

1

Tam, Donna. "Gallager's algorithm and the count-to-infinity problem." Thesis, McGill University, 1990. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=59431.

Full text
Abstract:
Multi-path routing algorithms in packet-switched computer networks have the potential for achieving high throughput and low average packet delay by making use of several paths to route data from a source to a destination. In this thesis, we investigate a multi-path algorithm proposed by Gallager (GALL77) which, given continuously differentiable link flows, has been proven to generate "optimal" routes in a quasi-static environment. However, the performance of the algorithm in a realistic environment has not been established. We show that the Count-to-Infinity problem is inherent in this algorithm and we describe a method of dealing with it. Employing two separate approximations for network flow gradients, we compare its performance to that of a single-path algorithm (using a network simulator based on the ARPANET). We establish the fact that Gallager's algorithm can achieve significantly better results in networks which are not failure prone and are not too large.
APA, Harvard, Vancouver, ISO, and other styles
2

Song, Chenxi. "USER ACTIVITY TRACKER USING ANDROID SENSOR." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1418938538.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Létourneau, Étienne. "Impact of algorithm, iterations, post-smoothing, count level and tracer distribution on single-frame positrom emission tomography quantification using a generalized image space reconstruction algorithm." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=110750.

Full text
Abstract:
Positron Emission Tomography (PET) is a medical imaging technique tracing the functional processes inside a subject. One of the common applications of this device is to perform a subjective diagnostic from the images. However, quantitative imaging (QI) allows one to perform an objective analysis as well as providing extra information such as the time activity curves (TAC) and visual details that the eye can't see. The aim of this work was to, by comparing several reconstruction algorithms such as the MLEM PSF, ISRA PSF and its related algorithms and FBP for single-frame imaging, to develop a robust analysis on the quantitative performance depending on the region of interest (ROI), the size of the ROI, the noise level, the activity distribution and the post-smoothing parameters. By simulating an acquisition using a 2-D digital axial brain phantom on Matlab, comparison has been done on a quantitative point of view helped by visual figures as explanatory tools for all the techniques using the Mean Absolute Error (MAE) and the Bias-Variance relation. Results show that the performance of each algorithm depends mainly on the number of counts coming from the ROI and the iteration/post-smoothing combination that, when adequately chosen, allows nearly every algorithms to give similar quantitative results in most cases. Among the 10 analysed techniques, 3 distinguished themselves: ML-EM PSF, ISRA PSF with the smoothed expected data as weight and the FBP with an adequate post-smoothing were the main contenders for achieving the lowest MAE. Keywords: Positron Emission Tomography, Maximum-Likelihood Expectation-Maximization, Image Space Reconstruction Algorithm, Filtered Backprojection, Mean Absolute Error, Quantitative Imaging.
La tomographie par Émission de Positons est une technique d'imagerie médicale traçant les procédures fonctionnelles qui se déroulent dans le patient. L'une des applications courantes de cet appareil consiste à performer un diagnostique subjectif à partir des images obtenues. Cependant, l'imagerie quantitative (IQ) permet de performer une analyse objective en plus de nous procurer de l'information additionnelle telle que la courbe temps-activité (CTA) ainsi que des détails visuels qui échappent à l'œil. Le but de ce travail était, en comparant plusieurs algorithmes de reconstruction tels que le ML-EM PSF, le ISRA PSF et les algorithmes qui en découlent ainsi que la rétroprojection filtrée pour une image bidimensionnelle fixe, de développer une analyse robuste sur les performances quantitatives dépendamment de la localisation des régions d'intérêt (RdI), de leur taille, du niveau de bruit dans l'image, de la distribution de l'activité et des paramètres post-lissage. En simulant des acquisitions à partir d'une coupe axiale d'un cerveau digitale sur Matlab, une comparaison quantitative appuyée de figures qualitative en guise d'outils explicatifs a été effectuée pour toutes les techniques de reconstruction à l'aide de l'Erreur Absolue Moyenne (EAM) et de la relation Biais-Variance. Les résultats obtenus démontrent que la performance de chaque algorithme dépend principalement du nombre d'événements enregistré provenant de la RdI ainsi que de la combinaison itération/post-lissage utilisée qui, lorsque choisie adéquatement, permet à la majorité des algorithmes étudiés de donner des quantités similaires dans la majorité des cas. Parmi les 10 techniques analysées, 3 se sont démarquées : ML-EM PSF, ISRA PSF en utilisant les valeurs prévues avec lissage comme facteur de pondération et RPF avec un post-lissage adéquat les principaux prétendants pour atteindre l'EMA minimale. Mots-clés: Tomographie par émission de positons, Maximum-Likelihood Expectation-Maximization, Image Space Reconstruction Algorithm, Rétroprojection Filtrée, Erreur Absolue Moyenne, Imagerie quantitative.
APA, Harvard, Vancouver, ISO, and other styles
4

Arvidsson, Klas. "Simulering av miljoner grindar med Count Algoritmen." Thesis, Linköping University, Department of Computer and Information Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2476.

Full text
Abstract:

A key part in the development and verification of digital systems is simulation. But hardware simulators are expensive, and software simulation is not fast enough for designs with a large number of gates. As today’s digital zesigns constantly grow in size (number of gates), and that trend shows no signs to end, faster simulators handling millions of gates are needed.

We investigate how to create a software gate-level simulator able to simulate a high number of gates fast. This involves a trade-off between memory requirement and speed. A compact netlist representation can utilize cache memories more efficient but requires more work to interpret, while high memory requirements can limit the performance to the speed of main memory.

We have selected the Counting Algorithm to implement the experimental simulator MICA. The main reasons for this choice is the compact way in which gates can be stored, but still be evaluated in a simple and standard way.

The report describes the issues and solutions encountered and evaluate the resulting simulator. MICA simulates a SPARC architecture processor called Leon. Larger netlists are achieved by simulating several instances of this processor. Simulation of 128 instances is done at a speed of 9 million gates per second using only 3.5MB memory. In MICA this design correspond to 2.5 million gates.

APA, Harvard, Vancouver, ISO, and other styles
5

Roemmele, Eric S. "A Flexible Zero-Inflated Poisson Regression Model." UKnowledge, 2019. https://uknowledge.uky.edu/statistics_etds/38.

Full text
Abstract:
A practical problem often encountered with observed count data is the presence of excess zeros. Zero-inflation in count data can easily be handled by zero-inflated models, which is a two-component mixture of a point mass at zero and a discrete distribution for the count data. In the presence of predictors, zero-inflated Poisson (ZIP) regression models are, perhaps, the most commonly used. However, the fully parametric ZIP regression model could sometimes be restrictive, especially with respect to the mixing proportions. Taking inspiration from some of the recent literature on semiparametric mixtures of regressions models for flexible mixture modeling, we propose a semiparametric ZIP regression model. We present an "EM-like" algorithm for estimation and a summary of asymptotic properties of the estimators. The proposed semiparametric models are then applied to a data set involving clandestine methamphetamine laboratories and Alzheimer's disease.
APA, Harvard, Vancouver, ISO, and other styles
6

Ding, Minsheng. "Energy efficient high port count optical switches." Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/275326.

Full text
Abstract:
The advance of internet applications, such as video streaming, big data and cloud computing, is reshaping the telecommunication and internet industries. Bandwidth demands in datacentres have been boosted by these emerging data-hungry internet applications. Regarding inter- and intra-datacentre communications, fine-grained data need to be exchanged across a large shared memory space. Large-scale high-speed optical switches tend to use a rearrangeably non-blocking architecture as this limits the number of switching elements required. However, this comes at the expense of requiring more sophisticated route selection within the switch and also some forms of time-slotted protocols. The looping algorithm is the classical routing algorithm to set up paths in rearrangeably non-blocking switches. It was born in the electronic switch era, where all links in the switches are equal. It is, therefore, not able to accommodate loss difference between optical paths due to the different length of waveguides and distinct numbers of crossings, and bends, leading to sub-optimal performance. We, therefore, propose an advanced path-selection algorithm based on the looping algorithm that minimises the path-dependent loss. It explores all possible set-ups for a given connection assignment and selects the optimal one. It guarantees that no individual path would have a sufficiently substantial loss, therefore, improve the overall performance of the switch. The performance of the proposed algorithm has been assessed by modelling switches using the VPI simulator. An 8×8 Clos-tree switch demonstrates a 2.7dB decrease in loss and 1.9dB improvement in IPDR with 1.5 dB penalty for the worst case. An 8×8 dilated Beneš shows more than 4 dB loss reduction for the lossiest path and 1.4 dB IPDR improvement for 1 dB power penalty. The improved algorithm can be run once for each switch design and store its output in a compact lookup table, enabling rapid switch reconfiguration. Microelectromechanical systems (MEMS) based optical switches have been fabricated with over 1,000 ports which meet the port count requirements in data centre networks. However, the reconfiguration speed of the MEMS switches is limited to the millisecond to microsecond timescale, which is not sufficient for packet switching in datacentres. Opto-electronic devices, such as Mach-Zehnder Interferometers (MZIs) and semiconductor optical amplifiers (SOAs) with nanosecond response time show the potential to fulfil the requirements of packet switching. However, the scalability of MZI switches is inherently limited by insertion loss and accumulated crosstalk, while the scalability of SOA switches is restricted by accumulated noise and distortion. We, therefore, have proposed a dilated Beneš hybrid MZI-SOA design, where MZIs are implemented as 1×2 or 2×1 low-loss switching elements, minimising crosstalk by using a single input, and where short SOAs are included as gain or absorption units, offering either loss compensation or crosstalk suppression though adding only minimal noise and distortion. A 4×4 device has been fabricated and exhibits a mere 1.3dB loss, an extinction ratio of 47dB, and more than 13dB IPDR for a 0.5dB power penalty. When operating with 10 Gb/s per port, 6pJ/bit energy consumption is demonstrated, delivering 20% reduced energy consumption compared with SOA-based switches. The tolerance of the current control accuracy of this switch is very broad. Within a 5 mA bias current range, the power penalty can be maintained below 0.2 dB for 8 dB IPDR and 12 mA for 10 dB IPDR with a penalty less 0.5 dB. The excellent crosstalk and power penalty performance demonstrated by this chip enable the scalability of this hybrid approach. The performance of 16×16 port dilated Beneš hybrid switch is experimentally assessed by cascading 4×4 switch chips, demonstrating an IPDR of 15 dB at a 1 dB penalty with a 0.6 dB power penalty floor. In terms of switches with port count larger than 16×16, the power penalty performance has been analysed with physical layer simulations fitted with state-of-the-art data. We assess the feasibility of three potential topologies, with different architectural optimisations: dilated Beneš, Beneš and Clos-Beneš. Quantitative analysis for switches with up to 2048 ports is presented, achieving a 1.15dB penalty for a BER of 10-3, compatible with soft-decision forward error correction.
APA, Harvard, Vancouver, ISO, and other styles
7

Lin, Cheng-Chin, and 林政錦. "A Minimum Hop-Count Multicast Algorithm for Reliable Multiple Streams Communication." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/50091904862595087461.

Full text
Abstract:
碩士
國立雲林科技大學
電子與資訊工程技術研究所
85
Thesis thesis concerned with the problem that a source node is to deliver multiple data streams to a group of destinations. Our goal is to generate a multicast tree with which the data streams requested by each destination can be delivered reliably and in minimum hop counts. We start with constructing a graph called edge-preserving subgraph by the breadth-first search principle. Then, with this subgraph, we establish the minimum hop-count multicast tree based on the affinity of the requests between the destinations. To achieve reliable transmissions, we present a bandwidth assignment algorithm for the concurrent transmissions of multiple streams and a level-by-level acknov/ledgment method to guarantee reliability. It is shown that our approach, while realizing the delivery of multiple streams in minimum hop counts and reliably, significantly reduces the number of acknowledgment messages, on the whole leveraging the network utilization and avoiding the occurrence of message implosion in the network.
APA, Harvard, Vancouver, ISO, and other styles
8

Lin, Cheng-Han, and 林政翰. "Hop-count Localization Algorithm with Multi-power Beacons for Wireless Sensor Networks." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/5s3846.

Full text
Abstract:
碩士
國立臺北科技大學
電機工程系所
100
With the fast development of wireless sensor networks (WSNs), WSNs are gradually applied to various fields, such as medical monitoring, and getting close attention to their promising potential. WSN localization methods play an important role in the aforementioned applications, because many applications involve the need of localization. To proposed an accurate localization method, this thesis focuses on calculating the number of hops and utilizes the multidimensional scaling analysis to estimate the coordinates of unknown nodes. Then, the method of multi-power transmission is used to refine some coordinates of nodes that might have larger errors. Incorporating the above concepts and taking the degree of irregularity (DOI) level in different environments into consideration, we propose a method, called the boundary- improved amorphous with multipower multidimensional scaling (BIA-MMS) localization algorithm. Comparing the simulation results of BIA-MMS with the results using the DV-hop and amorphous localization algorithm, BIA-MMS lead to a 25% improvement in the localization accuracy. With any different environmental noise, the location error can be maintained at about 10% of transmission range.
APA, Harvard, Vancouver, ISO, and other styles
9

Wu, Pei-Yun, and 吳珮芸. "An Efficient Generation of Candidate Itemsets and Count Algorithm for Mining Association Rules." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/39905924144178640330.

Full text
Abstract:
碩士
國立高雄應用科技大學
電子與資訊工程研究所碩士班
92
Mining association rules from transaction databases is one of important techniques in data mining. Applications of association rules extend to discovering frequent patterns in consumer behavior, marketing analysis, electronic commerce and education, and other areas. In this thesis, we developed EGC, is an efficient algorithm for mining association rules. The main improvements are EGC uses an innovative method for generating candidate itemsets by checking the numbers of the preceding frequent itemsets before joining procedure. And EGC uses the simple tree data structure for storing the candidate itemsets and counting their supports. In addition, EGC uses the database global pruning method of DCP for efficiently reducing the size of the database. The experiments show that the performance of EGC is better than Apriori and DHP,IHPwoTTP, and IHPwTTP. The execution time and memory required of EGC are less than Apriori, DHP, IHPwoTTP, and IHPwTTP. In other applications, EGC can efficiently mine interesting information from investor databases to provide the optimal portfolio for each investor of the brokerage securities firm.
APA, Harvard, Vancouver, ISO, and other styles
10

Hung, Chiang-Hsi, and 洪江西. "Using Overlapping Neighbor Count (ONC) Algorithm for Distance Estimation in Two-Dimensional Space." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/29322401400347359101.

Full text
Abstract:
碩士
國立中正大學
通訊工程研究所
99
Due to the rapid development of Wi-Fi, Zigbee and other wireless network technologies, the applications of Wireless Sensor Network (WSN) have been booming in recent years. Wireless sensor networks can be applied to environmental monitoring and control; moreover, in recent years a considerable number of scholars contribute to the studies of the use of WSN in target tracking and positioning. Be it tracking or positioning, in order to be comprehensive, sensor nodes must be able to estimate the distance to the target object or the distance between sensor nodes. This paper presents an algorithm which focuses on the distance estimation for WSN target tracking and positioning. In general, there are two types of positioning methods: Range-based and Range-free. Range-based positioning must have the information of distance or angle bwtween nodes to estimate the location. (GPS, AOA, TOA, and TDOA are the examples of range-based positioning method.) Because to measure the distance or angle information between nodes requires the assistance of additional hardware, the Range-based method is a relatively costly approach, though it also provides better accuracy. Another positioning method is Range-free which does not require additional hardware to measure the distance or angle. TheRange-free method usually uses the communication capacity between the nodes to obtain the hop-count or the neighbor number information from which the positioning estimation can be derived. Although the cost of the Range-free method is cheaper than that of the Range-based method, itspositioning accuracy is also relatively lower than that of the Range-based method. However, a WSN usually needs to deploy multiple sensor nodes in its working environment. This makes Range-free method quite suitable for WSN applications. An algorithm which is similar to the Range-free method is proposed in this thesis to estimate the distance between sensor nodes. We consider a two-dimensional environment. Through exchanging messages, two neighbor sensor nodes can find their common neighbors. Based on the number of common neighbors and the sensor node density, the proposed algorithm can estimate the distance between two nodes. The performance of the proposed algorithm is evaluated by simulations with two scenarios: sensor nodes are either regular distributed or uniformly random distributed. The impact of node density on the estimation accuracy is also discussed in the simulation study.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Count-algorithm"

1

Green, Mick. Statistical methods for areal interpolation: The EM algorithm for count data. Lancaster: North West Regional Research Laboratory, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Count-algorithm"

1

Ahuja, Laxmi. "Label Count Algorithm for Web Crawler-Label Count." In Advances in Intelligent Systems and Computing, 525–31. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-8848-3_50.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Golov, Nikolay, Alexander Filatov, and Sergey Bruskin. "Efficient Exact Algorithm for Count Distinct Problem." In Computer Algebra in Scientific Computing, 67–77. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-26831-2_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jeras, Iztok, and Andrej Dobnikar. "Cellular Automata Preimages: Count and List Algorithm." In Computational Science – ICCS 2006, 345–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11758532_47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hoi, Gordon, Sanjay Jain, and Frank Stephan. "A Faster Exact Algorithm to Count X3SAT Solutions." In Lecture Notes in Computer Science, 375–91. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58475-7_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rescigno, Aldo, and Richard M. Lambrecht. "An Algorithm for Reconstruction of Count Rate Curves from Total Counts." In Lecture Notes in Biomathematics, 399–408. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/978-3-642-93287-8_54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Jianxin, Gao, Huang Yongsheng, and Wang Huan. "An Enhanced Recommendation Algorithm Based on the Count of Common Rated Items." In Communications in Computer and Information Science, 518–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24022-5_82.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mohanty, Rakesh, and Ashirbad Mishra. "Performance Evaluation of A Novel Most Recently Used Frequency Count (MRUFC) List Accessing Algorithm." In Advances in Intelligent Systems and Computing, 267–76. New Delhi: Springer India, 2013. http://dx.doi.org/10.1007/978-81-322-0740-5_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ibrahim, Mohamed, Cherif Salama, M. Watheq El-Kharashi, and Ayman Wahba. "Pin-Count and Wire Length Optimization for Electrowetting-on-Dielectric Chips: A Metaheuristics-Based Routing Algorithm." In Computational Intelligence in Digital and Network Designs and Applications, 271–94. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-20071-2_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Idowu, Peter Adebayo, and Jeremiah Ademola Balogun. "Development of a Classification Model for CD4 Count of HIV Patients Using Supervised Machine Learning Algorithms." In Computational Models for Biomedical Reasoning and Problem Solving, 149–76. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-7467-5.ch006.

Full text
Abstract:
This chapter was developed with a view to present a predictive model for the classification of the level of CD4 count of HIV patients receiving ART/HAART treatment in Nigeria. Following the review of literature, the pre-determining factors for determining CD4 count were identified and validated by experts while historical data explaining the relationship between the factors and CD4 count level was collected. The predictive model for CD4 count level was formulated using C4.5 decision trees (DT), support vector machines (SVM), and the multi-layer perceptron (MLP) classifiers based on the identified factors which were formulated using WEKA software and validated. The results showed that decision trees algorithm revealed five (5) important variables, namely age group, white blood cell count, viral load, time of diagnosing HIV, and age of the patient. The MLP had the best performance with a value of 100% followed by the SVM with an accuracy of 91.1%, and both were observed to outperform the DT algorithm used.
APA, Harvard, Vancouver, ISO, and other styles
10

Sharma, Oshin, and Hemraj Saini. "Energy and SLA Efficient Virtual Machine Placement in Cloud Environment Using Non-Dominated Sorting Genetic Algorithm." In Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms, 773–89. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-8048-6.ch039.

Full text
Abstract:
To increase the availability of the resources and simultaneously to reduce the energy consumption of data centers by providing a good level of the service are one of the major challenges in the cloud environment. With the increasing data centers and their size around the world, the focus of the current research is to save the consumption of energy inside data centers. Thus, this article presents an energy-efficient VM placement algorithm for the mapping of virtual machines over physical machines. The idea of the mapping of virtual machines over physical machines is to lessen the count of physical machines used inside the data center. In the proposed algorithm, the problem of VM placement is formulated using a non-dominated sorting genetic algorithm based multi-objective optimization. The objectives are: optimization of the energy consumption, reduction of the level of SLA violation and the minimization of the migration count.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Count-algorithm"

1

Subha, S. "A leading zero(es) count algorithm." In 2017 Third International Conference on Advances in Electrical, Electronics, Information, Communication and Bio-Informatics (AEEICB). IEEE, 2017. http://dx.doi.org/10.1109/aeeicb.2017.7972335.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Argote Pedraza, Ingrid Lorena, Leonardo Bonacini, Alexandre Senni, John Archila, and Mario Luiz Tronco. "Machine Vision Algorithm For Coffee Fruits Count." In 25th International Congress of Mechanical Engineering. ABCM, 2019. http://dx.doi.org/10.26678/abcm.cobem2019.cob2019-2187.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dessart, Nathalie, and Philipe Hunel. "Multi-paths individuals count algorithm over WSN." In 2012 International Conference on Wireless on Communications in Underground and Confined Areas (ICWCUCA). IEEE, 2012. http://dx.doi.org/10.1109/icwcuca.2012.6402496.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Terra, Rui, Lino Figueiredo, Ramiro Barbosa, and Ricardo Anacleto. "Step count algorithm adapted to indoor localization." In the International C* Conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2494444.2494457.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

El Assaf, Ahmad, Slim Zaidi, Sofiene Affes, and Nahi Kandil. "Hop-count based localization algorithm for wireless sensor networks." In 2013 13th Mediterranean Microwave Symposium (MMS). IEEE, 2013. http://dx.doi.org/10.1109/mms.2013.6663118.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Singh, Shyam Kumar, and Preetham Kumar. "I2Apriori: An improved apriori algorithm based on infrequent count." In 2016 International Conference on Electrical, Electronics, and Optimization Techniques (ICEEOT). IEEE, 2016. http://dx.doi.org/10.1109/iceeot.2016.7754889.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cao, Liangben, Xixin Zhang, Jingyu Pu, Siyuan Xu, Xinlin Cai, and Zhiyong Li. "The Field Wheat Count Based on the Efficientdet Algorithm." In 2020 IEEE 3rd International Conference on Information Systems and Computer Aided Education (ICISCAE). IEEE, 2020. http://dx.doi.org/10.1109/iciscae51034.2020.9236918.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zhu, Huasheng, Chenguang Xu, and Fan Li. "The Traffic Volume Count Algorithm Based on Computer Vision." In 2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics (IHMSC). IEEE, 2013. http://dx.doi.org/10.1109/ihmsc.2013.38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Daneshmand, Mahmoud, Chonggang Wang, and Kazem Sohraby. "A New Slot-Count Selection Algorithm for RFID Protocol." In 2007 Second International Conference on Communications and Networking in China. IEEE, 2007. http://dx.doi.org/10.1109/chinacom.2007.4469535.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yu, Bowen, Yu Zhang, and Lubing Li. "Parallelizing Count-Min Sketch Algorithm on Multi-core Processors." In 2016 6th International Conference on Machinery, Materials, Environment, Biotechnology and Computer. Paris, France: Atlantis Press, 2016. http://dx.doi.org/10.2991/mmebc-16.2016.472.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Count-algorithm' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography