Bibliographies thématiques / Z Algorithm

Sommaire

  1. Articles de revues
  2. Thèses
  3. Livres
  4. Chapitres de livres
  5. Actes de conférences

Littérature scientifique sur le sujet « Z Algorithm »

Auteur : Grafiati
Publié le 4 juin 2021
Mis à jour le 1 février 2022

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Z Algorithm ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Z Algorithm"

1

Munakomi, Sunil, et Karuna Tamrakar. « Introducing ′A-Z′ algorithm for extubation ». International Journal of Students� Research 4, no 2 (2014) : 56. http://dx.doi.org/10.4103/2230-7095.149784.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Er, M. C. « Remark on “Algorithm 246 : Graycode [Z]” ». ACM Transactions on Mathematical Software 11, no 4 (décembre 1985) : 441–43. http://dx.doi.org/10.1145/6187.356154.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Vassiliadis, S., M. Putrino et E. Swartz. « Direct two's-complement algorithm forxy±z ». Electronics Letters 23, no 10 (7 mai 1987) : 538–40. http://dx.doi.org/10.1049/el:19870388.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Biswas, Siddhartha. « Z-Dijkstra’s Algorithm to solve Shortest Path Problem in a Z-Graph ». Oriental journal of computer science and technology 10, no 1 (23 mars 2017) : 180–86. http://dx.doi.org/10.13005/ojcst/10.01.24.

Texte intégral
Résumé :
In this paper the author introduces the notion of Z-weighted graph or Z-graph in Graph Theory, considers the Shortest Path Problem (SPP) in a Z-graph. The classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to Z-graphs. Consequently the author proposes a new algorithm called by Z-Dijkstra's Algorithm with the philosophy of the classical Dijkstra's Algorithm to solve the SPP in a Z-graph.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Benyahia, Ismahane, Abdesselam Bassou, Chems El Houda Allaoui et Mohammed Beladgham. « Modified spiht algorithm for quincunx wavelet image coding ». Indonesian Journal of Electrical Engineering and Computer Science 16, no 1 (1 octobre 2019) : 230. http://dx.doi.org/10.11591/ijeecs.v16.i1.pp230-242.

Texte intégral
Résumé :
<span lang="EN-US">In this paper, an image compression method based on the Quincunx algorithm coupled with the modified SPIHT encoder (called SPIHT-Z) is presented. The SPIHT-Z encoder (coupled with quincunx transform) provides better compression results compared with two other algorithms: conventional wavelet and quincunx both coupled with the SPIHT encoder. The obtained results, using the algorithm that applies (Quincunx with SPIHT-Z) are evaluated by image quality evaluation parameters (PSNR, MSSIM, and VIF). The compression results on twenty test images showed that the proposed algorithm achieved better levels of the image evaluation parameters at low bit rates.</span>
Styles APA, Harvard, Vancouver, ISO, etc.
6

Guo, Sha-sha, Jie-sheng Wang et Meng-wei Guo. « Z-Shaped Transfer Functions for Binary Particle Swarm Optimization Algorithm ». Computational Intelligence and Neuroscience 2020 (8 juin 2020) : 1–21. http://dx.doi.org/10.1155/2020/6502807.

Texte intégral
Résumé :
Particle swarm optimization (PSO) algorithm is a swarm intelligent searching algorithm based on population that simulates the social behavior of birds, bees, or fish groups. The discrete binary particle swarm optimization (BPSO) algorithm maps the continuous search space to a binary space through a new transfer function, and the update process is designed to switch the position of the particles between 0 and 1 in the binary search space. Aiming at the existed BPSO algorithms which are easy to fall into the local optimum, a new Z-shaped probability transfer function is proposed to map the continuous search space to a binary space. By adopting nine typical benchmark functions, the proposed Z-probability transfer function and the V-shaped and S-shaped transfer functions are used to carry out the performance simulation experiments. The results show that the proposed Z-shaped probability transfer function improves the convergence speed and optimization accuracy of the BPSO algorithm.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Renaud, C. « Fast Local and Global Illuminations Through a Simd Z-Buffer ». International Journal of Pattern Recognition and Artificial Intelligence 11, no 07 (novembre 1997) : 1095–112. http://dx.doi.org/10.1142/s0218001497000500.

Texte intégral
Résumé :
The z-buffer is a well-known hidden-part removal technique commonly used by local illumination algorithms. Some global illumination approaches use this technique too, in order to approximate energy exchanges. In this paper we propose a massively parallel implementation of the z-buffer on the MP-1 machine. Efficiency is achieved by precisely studying the different stages of the algorithm, and by taking care in correctly using the SIMD control of the architecture. Local illumination models are then applied to the z-buffer algorithm, by using Gouraud and Phong's interpolations. Finally, the parallel z-buffer is used in a massively parallel radiosity algorithm. The results obtained allow to provide quickly illuminated images by decreasing dramatically the computation time required for global illumination.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Aude, J. C., et A. Louis. « An incremental algorithm for Z-value computations ». Computers & ; Chemistry 26, no 5 (juillet 2002) : 402–10. http://dx.doi.org/10.1016/s0097-8485(02)00003-7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Dear, R. G., et Y. S. Sherif. « Z-Basic algorithm for collision avoidance system ». IEEE Transactions on Systems, Man, and Cybernetics 21, no 4 (1991) : 915–21. http://dx.doi.org/10.1109/21.108309.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Boodoo, Sudesh, David Hudak, Alexander Ryzhkov, Pengfei Zhang, Norman Donaldson, David Sills et Janti Reid. « Quantitative Precipitation Estimation from a C-Band Dual-Polarized Radar for the 8 July 2013 Flood in Toronto, Canada ». Journal of Hydrometeorology 16, no 5 (1 octobre 2015) : 2027–44. http://dx.doi.org/10.1175/jhm-d-15-0003.1.

Texte intégral
Résumé :
Abstract A heavy rainfall event over a 2-h period on 8 July 2013 caused significant flash flooding in the city of Toronto and produced 126 mm of rain accumulation at a gauge located near the Toronto Pearson International Airport. This paper evaluates the quantitative precipitation estimates from the nearby King City C-band dual-polarized radar (WKR). Horizontal reflectivity Z and differential reflectivity ZDR were corrected for attenuation using a modified ZPHI rain profiling algorithm, and rain rates R were calculated from R(Z) and R(Z, ZDR) algorithms. Specific differential phase KDP was used to compute rain rates from three R(KDP) algorithms, one modified to use positive and negative KDP, and an R(KDP, ZDR) algorithm. Additionally, specific attenuation at horizontal polarization A was used to calculate rates from the R(A) algorithm. High-temporal-resolution rain gauge data at 44 locations measured the surface rainfall every 5 min and produced total rainfall accumulations over the affected area. The nearby NEXRAD S-band dual-polarized radar at Buffalo, New York, provided rain-rate and storm accumulation estimates from R(Z) and S-band dual-polarimetric algorithm. These two datasets were used as references to evaluate the C-band estimates. Significant radome attenuation at WKR overshadowed the attenuation correction techniques and resulted in poor rainfall estimates from the R(Z) and R(Z, ZDR) algorithms. Rainfall estimation from the Brandes et al. R(KDP) and R(A) algorithms were superior to the other methods, and the derived storm total accumulation gave biases of 2.1 and −6.1 mm, respectively, with correlations of 0.94. The C-band estimates from the Brandes et al. R(KDP) and R(A) algorithms were comparable to the NEXRAD S-band estimates.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "Z Algorithm"

1

Cardelino, Carlos Antonio. « A parellel algorithm for solving a complex function f(z) = 0 ». Thesis, Georgia Institute of Technology, 1985. http://hdl.handle.net/1853/8147.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Kluska, Martin. « Získávání znalostí z procesních logů ». Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2019. http://www.nusl.cz/ntk/nusl-399172.

Texte intégral
Résumé :
This Master's describes knownledge discovery from process logs by using process mining algorithms. Chosen algorithms are described in detail. These aim to create process model based on event log analysis. The goal is to design such components, which would be able to import the process and run the simulations. Results from components can be used for short term planning.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Šrutová, Martina. « Diagnostika ventrikulárních tachykardií z elektrokardiografického záznamu ». Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2010. http://www.nusl.cz/ntk/nusl-218715.

Texte intégral
Résumé :
The aim of this thesis is a diagnosis of ventricular tachycardias, fibrillations and flutters from electrocardiogram. These disturbances of heart rate are ranked among the life threatening arrhytmias. This work presents own method of the automatic detection, which is created for the ECG holter monitoring system. The proposed algorithm is based on the detection in the spectral domain, which is supported by the detection in the time domain. The results show the discrimination of arrhytmias from the normal sinus rhythm and the discrimination from the noise. The method is tested with ECG records from the The AHA Database (American Heart Association) and from The MIT-BIH Malignant Ventricular Arrhythmia Database.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Malengret, Jean-Claude. « A 3-phase Z-source inverter driven by a novel hybrid switching algorithm ». Master's thesis, University of Cape Town, 2007. http://hdl.handle.net/11427/14698.

Texte intégral
Résumé :
A 3-phase Z-source inverter has been researched, designed, simulated, builtand tested. The purpose of the inverter is to deliver 3-phase 400 VAC from aDC supply that can vary over a range of 20 to 70 Vdc. This is done with a Zsourceinverter topology which is a single conversion method with no additionalDC to DC boost converter. A novel DSP control algorithm allows the inverter toachieve the following:· Run Space Vector Pulse Width Modulation (SV-PWM) for maximum DCbus voltage utilization while boosting the DC bus during zero space vectorstates using shoot through.· Seamless transition between modulation control and modulation / shootthrough control.· Optimised efficiency and DC bus utilisation using Hybrid Space VectorBoost Pulse Width Modulation (HSVB PWM) which is unique to thisdissertation.Such a system is particularly suited to fuel cell and particularly wind turbineapplications where the DC bus voltage is varies over a wide range resulting inthe need for a DC to DC buck/boost to regulate the DC bus to maintain a steady3-phase sinusoidal output. A further application could be for general purpose 3-phase inverter capable of operating on different DC standard bus voltages ( e.g.24, 36, 48 VDC).The benefits of a Z-source topology for the above purposes are a reduction inhigh power semi-conductor components (e.g. power MOSFET). There is also areduction in switching losses and inherent shoot through protection.Furthermore, the inverter is more robust in the sense that it is not vulnerable to spurious shoot through, which could be disastrous in the case of a traditionalvoltage fed inverter.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Chmelíková, Lucie. « Bezkontaktní měření tepové frekvence z obličeje ». Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2016. http://www.nusl.cz/ntk/nusl-241972.

Texte intégral
Résumé :
This thesis deals with the study of contactless and noninvasive methods for estimation of heart rate. Contactless measurement is based on capturing person faces by video camera and from sequences of pictures are estimated values of the heart rate. The theoretical part describes heart rate and methods that are being used to estimate heart rate from color changes in the face. It also contains testing of tracking algorithms. Practical part deals with user interface of program for contactless measurement of heart rate and its software solution. Thesis also contains statistical evaluation of program functionality.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Rybka, Ondřej. « Problém plnění palet a využití jedné z jeho heuristik při rozmístění zboží ve skladu ». Master's thesis, Vysoká škola ekonomická v Praze, 2009. http://www.nusl.cz/ntk/nusl-76813.

Texte intégral
Résumé :
This work concerns new borders, heuristics, algoritms and mathematic models of pallet loading problem (PLP). We try to describe these computational methods and find out if we can use them in real. We maximalize number of boxes placed on rectangular pallets in a particular warehouse by using chosen heuristics. Every box has a rectangular form with the same lenght and width and is fully placed on the pallet. We can rotate with the box by 90% degree until it is fixed as we want and its side lies parallelly with side of the pallet. All instances are setted in model (X, Y, a, b), where X is lenght, Y width of the pallet, a lenght and b width of the box.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Chlup, Jiří. « Optimalizace expedice zboží z regálového systému logistického skladu ». Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2009. http://www.nusl.cz/ntk/nusl-228828.

Texte intégral
Résumé :
The diploma thesis submitted solves problems of optimization of goods expedition from rack system of a logistic store. It concerns solution of a practical task which optimizes a passage route through the rack system and evaluates individual orders for creation of optimal expedition dispatching batch. The existing dispatching system, use of sources and creation of time schedule is being described at the beginning. Description of general practical solutions of seeking the shortest way through the graph through appointed nodes follows. Chosen solution and its practical implementation are introduced afterwards. Comparative tests with existing system and their evaluations are mentioned at the end of the thesis.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Smékal, Luděk. « Získávání znalostí z textových dat ». Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2007. http://www.nusl.cz/ntk/nusl-412756.

Texte intégral
Résumé :
This MSc Thesis handles with so-called data mining. Data mining is about obtaining some data or informations from databases, where these data or informations are not directly visible, but they are accessible by using special algorithms. This MSc Thesis mainly aims documents clasifying by selected method in scope of digital library. The selected method is based on sets of items called "itemsets method". This method extends Apriori algorithm application field originally designed for transaction databases processing and generation of sets of frequented items.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Semerád, Lukáš. « Generování kryptografického klíče z biometrických vlastností oka ». Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-236038.

Texte intégral
Résumé :
The main topic of the thesis is creation of formulas for the amount of information entropy in biometric characteristics of iris and retina. This field of science in biometrics named above is unstudied yet, so the thesis tries to initiate research in this direction. The thesis also discusses the historical context of security and identification fields according to biometric characteristics of a human being with an overlap for potential usage in biometrics of iris and retina. The Daugman’s algorithm for converting iris image into the binary code which can be used as a cryptographic key is discussed in detail. An application implementing this conversion is also a part of the thesis.
Styles APA, Harvard, Vancouver, ISO, etc.
10

Smékal, Ondřej. « Restaurace obrazových dat z optické koherenční tomografie ». Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-219497.

Texte intégral
Résumé :
Restoration of image data has become an essential part of the processing of medical images obtained by any system. The same applies in the case of optical coherence tomography. The aim of this work is to study the first restoration methods. Second, the description of the data representation from optical coherence tomography and subsequent discussions that restoration methods based on deconvolution would potentially find application in processing of Optical coherence tomography. Finally, the third to create a program solution of the OCT data restoration process in MATLAB environment and followed by discussion of effectiveness of the presented solutions.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Livres sur le sujet "Z Algorithm"

1

Wasserbauer, Andreas Koloman. A fast z-buffer algorithm : Amulti resolution approach. Oxford : Oxford Brookes University, 2001.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Mrzygłód, Mirosław. Algorytm optymalizacji topologicznej konstrukcji ciągłych z ograniczeniami zmęczeniowymi : Algorithm of topology optimization of continuous structures with fatigue constraints = [Algoritm topologicheskoĭ optimizat︠s︡ii nepreryvnykh konstrukt︠s︡ii s ustalostnymi ogranichenii︠a︡mi]. Kraków : Politechnika Krakowska im. Tadeusza Kościuszki, 2013.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

John, Fitzgerald, Gnesi Stefania, Khurshid Sarfraz, Leuschel Michael, Reeves Steve, Riccobene Elvinia et SpringerLink (Online service), dir. Abstract State Machines, Alloy, B, VDM, and Z : Third International Conference, ABZ 2012, Pisa, Italy, June 18-21, 2012. Proceedings. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Cierniak, Robert. Nowe algorytmy rekonstrukcji obrazu z projekcji z zastosowaniem sieci neuronowych typu Hopfielda. Częstochowa : Wydawn. Politechniki Częstochowskiej, 2006.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Bogucka, Hanna. Nowe metody poprawy jakości transmisji i odbioru sygnałów z modulacją wieloczęstotliwościową i poszerzonym widmem. Poznań : Wydawn. Politechniki Poznańskiej, 2006.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Yang, Xile. Automatic software test data generation from z specifications using evolutionary algorithms. 1998.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Matloff, Norm. From Algorithms to Z-Scores : Probabilistic and Statistical Modeling in Computer Science. University Press of Florida, 2009.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Collis, Rachel, Sarah Harries et Abrie Theron, dir. Obstetric Anaesthesia. 2e éd. Oxford University Press, 2020. http://dx.doi.org/10.1093/med/9780199688524.001.0001.

Texte intégral
Résumé :
Starting work on the labour ward is very challenging for all junior anaesthetists. This handbook is an easily navigated practical reference guide for anaesthetists new to this environment, as well as other members of the labour ward multi-disciplinary team; midwives, obstetricians, and Consultant Anaesthetists who visit labour ward less frequently or only when on-call. It covers all aspects of obstetric anaesthesia that the trainee anaesthetist will encounter during their obstetric training module, and is essential reading for FRCA exam preparation. Since the first edition, there is no doubt that the pregnant population has become more complex, with increasing maternal age and BMI, and challenging co-morbidities presenting more frequently. As well as providing updates from recent MBRRACE reports and national guidelines, new techniques, drugs, and technology, such as point of care testing have been included. New chapters covering the application of ultrasound in obstetric anaesthesia, recognition of the sick and septic patient, maternal obesity and neonatal resuscitation have been introduced. Previous chapters, e.g. haemorrhage, have been extensively updated, with the latest management protocols and algorithms based on recent published research in obstetric bleeding. We have retained our practical guides to performing, managing, and trouble-shooting regional techniques that are more problematic on labour ward, and our extensive A–Z of rarer conditions has updated references. More conventional chapters on maternal physiology and pathophysiology provide readers with essential examination material. The importance of anticipating risk in the antenatal period through high risk anaesthetic assessment clinics and postpartum management of tricky neurological complications is also well covered.
Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Z Algorithm"

1

Louwerse, Max M., et Patrick Jeuniaux. « A computational psycholinguistic algorithm to measure cohesion in discourse ». Dans Discourse, of Course, 213–23. Amsterdam : John Benjamins Publishing Company, 2009. http://dx.doi.org/10.1075/z.148.21lou.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Han, Nguyen Dinh, Dang Quyet Thang et Phan Trung Huy. « A Quadratic Algorithm for Testing of Z-Codes ». Dans Intelligent Information and Database Systems, 455–64. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36546-1_47.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Castiglione, Giusi, et Paolo Massazza. « An Efficient Algorithm for the Generation of Z-Convex Polyominoes ». Dans Lecture Notes in Computer Science, 51–61. Cham : Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07148-0_6.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Smith, Alf. « The Knuth-Bendix Completion Algorithm and Its Specification in Z ». Dans Workshops in Computing, 195–220. London : Springer London, 1990. http://dx.doi.org/10.1007/978-1-4471-3877-8_14.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Kim, Sungwhan, Jin Keun Seo, Sungwan Kim, Eung Je Woo, Kiwan Jun et Chang Ok Lee. « Local harmonic Bz algorithm in MREIT ». Dans IFMBE Proceedings, 492–95. Berlin, Heidelberg : Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73841-1_127.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Archangelsky, Kostyantyn. « Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z - Σ*-Automata ». Dans Developments in Language Theory, 283–89. Berlin, Heidelberg : Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45005-x_24.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Attiogbé, J. Christian. « A Stepwise Development of the Peterson’s Mutual Exclusion Algorithm Using B Abstract Systems ». Dans ZB 2005 : Formal Specification and Development in Z and B, 124–41. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11415787_8.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Que, Jialan, Fu-Chiang Tsui et Jeremy Espino. « A Z-Score Based Multi-level Spatial Clustering Algorithm for the Detection of Disease Outbreaks ». Dans Lecture Notes in Computer Science, 108–18. Berlin, Heidelberg : Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89746-0_11.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Mandal, J. K., A. Khamrui, S. Chakraborty, P. Sur, S. K. Datta et I. RoyChoudhury. « A Novel Genetic Algorithm Based Data Embedding Technique in Frequency Domain Using Z Transform (ANGAFDZT) ». Dans Advances in Computing and Information Technology, 885–93. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-31552-7_90.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Han, Xiaoxu, James Cremer, Zhihong Wang et Jun Ni. « LRZB, a Hybrid Algorithm of Local Ray-Casting and Z-Buffering for Large Geometric Datasets ». Dans Grid and Cooperative Computing - GCC 2004 Workshops, 720–27. Berlin, Heidelberg : Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30207-0_88.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Z Algorithm"

1

Wand, Michael, Matthias Fischer, Ingmar Peter, Friedhelm Meyer auf der Heide et Wolfgang Straßer. « The randomized z-buffer algorithm ». Dans the 28th annual conference. New York, New York, USA : ACM Press, 2001. http://dx.doi.org/10.1145/383259.383299.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Castle, R. J. « A 2‐DV(z)DMO algorithm ». Dans SEG Technical Program Expanded Abstracts 1993. Society of Exploration Geophysicists, 1993. http://dx.doi.org/10.1190/1.1822314.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Silva, Luis M., J. Marques De Sa et Luis A. Alexandre. « New developments of the Z-EDM algorithm ». Dans 2006 6th International Conference on Intelligent Systems Design and Applications. IEEE, 2006. http://dx.doi.org/10.1109/isda.2006.204.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Stewart, Nigel, Geoff Leach et Sabu John. « An improved z-buffer CSG rendering algorithm ». Dans the ACM SIGGRAPH/EUROGRAPHICS workshop. New York, New York, USA : ACM Press, 1998. http://dx.doi.org/10.1145/285305.285308.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Kumar, A. A., D. Singh et A. Dhakar. « New control algorithm for impedance (Z-source) inverter ». Dans 2013 International Multi-Conference on Automation, Computing, Communication, Control and Compressed Sensing (iMac4s). IEEE, 2013. http://dx.doi.org/10.1109/imac4s.2013.6526491.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Ramadan, Omar. « Z-transform PML algorithm for truncating metamaterial FDTD domains ». Dans 2006 IEEE GCC Conference. IEEE, 2006. http://dx.doi.org/10.1109/ieeegcc.2006.5686228.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Zeng, Weifei, Viveck Cadambe et Muriel Medard. « A recursive coding algorithm for two-unicast-Z networks ». Dans 2014 IEEE Information Theory Workshop (ITW). IEEE, 2014. http://dx.doi.org/10.1109/itw.2014.6970887.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Baghbany Oskouei, Aida, et Seyed Hossein Hosseini. « A novel SVC algorithm for multilevel Z-source inverter ». Dans 2013 4th Power Electronics, Drive Systems & Technologies Conference (PEDSTC). IEEE, 2013. http://dx.doi.org/10.1109/pedstc.2013.6506686.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Wang, Liying, et Weidong Song. « Airborne LiDAR Strip Adjustment Based on Least Z-Difference Algorithm ». Dans 2010 International Conference on Multimedia Technology (ICMT). IEEE, 2010. http://dx.doi.org/10.1109/icmult.2010.5631126.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Al-Anzi, Fawaz, Mohamed Al-Enezi et Jyoti Soni. « Notice of Removal : New proposed Z-transform based encryption algorithm ». Dans 2016 6th International Conference on IT Convergence and Security (ICITCS). IEEE, 2016. http://dx.doi.org/10.1109/icitcs.2016.7740356.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Z Algorithm » pour d’autres types de sources :
Articles de revues Thèses
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie