Littérature scientifique sur le sujet « POSTERIORI ALGORITHM »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
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 « POSTERIORI 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 "POSTERIORI ALGORITHM"
Utsugi, Akio, et Toru Kumagai. « Bayesian Analysis of Mixtures of Factor Analyzers ». Neural Computation 13, no 5 (1 mai 2001) : 993–1002. http://dx.doi.org/10.1162/08997660151134299.
Texte intégralLee, Jun, et Jaejin Lee. « Modified maximum a posteriori decoding algorithm ». Electronics Letters 37, no 11 (2001) : 698. http://dx.doi.org/10.1049/el:20010486.
Texte intégralXia, Meidong, Chengyou Wang et Wenhan Ge. « Weights-Based Image Demosaicking Using Posteriori Gradients and the Correlation of R–B Channels in High Frequency ». Symmetry 11, no 5 (26 avril 2019) : 600. http://dx.doi.org/10.3390/sym11050600.
Texte intégralTolpin, David, et Frank Wood. « Maximum a Posteriori Estimation by Search in Probabilistic Programs ». Proceedings of the International Symposium on Combinatorial Search 6, no 1 (1 septembre 2021) : 201–5. http://dx.doi.org/10.1609/socs.v6i1.18369.
Texte intégralArar, Maher, Claude D'Amours et Abbas Yongacoglu. « Simplified LLRs for the Decoding of Single Parity Check Turbo Product Codes Transmitted Using 16QAM ». Research Letters in Communications 2007 (2007) : 1–4. http://dx.doi.org/10.1155/2007/53517.
Texte intégralPan, Lu, Xiaoming He et Tao Lü. « High Accuracy Combination Method for Solving the Systems of Nonlinear Volterra Integral and Integro-Differential Equations with Weakly Singular Kernels of the Second Kind ». Mathematical Problems in Engineering 2010 (2010) : 1–21. http://dx.doi.org/10.1155/2010/901587.
Texte intégralKarimi, Mohammad, Maryam Miriestahbanati, Hamed Esmaeeli et Ciprian Alecsandru. « Multi-Objective Stochastic Optimization Algorithms to Calibrate Microsimulation Models ». Transportation Research Record : Journal of the Transportation Research Board 2673, no 4 (29 mars 2019) : 743–52. http://dx.doi.org/10.1177/0361198119838260.
Texte intégralLee, Dongwook, et Rémi Bourgeois. « GP-MOOD : a positivity-preserving high-order finite volume method for hyperbolic conservation laws ». Proceedings of the International Astronomical Union 16, S362 (juin 2020) : 373–79. http://dx.doi.org/10.1017/s1743921322001363.
Texte intégralNguyen, Hoang Nguyen. « SYNTHESIS OF A RADAR RECOGNITION ALGORITHM WITH ABILITY TO MEET RELIABILITY OF DECISIONS ». Journal of Science and Technique 14, no 5 (26 avril 2021) : 87–95. http://dx.doi.org/10.56651/lqdtu.jst.v14.n05.257.
Texte intégralKang, Jiayi, Andrew Salmon et Stephen S. T. Yau. « Log-Concave Posterior Densities Arising in Continuous Filtering and a Maximum A Posteriori Algorithm ». SIAM Journal on Control and Optimization 61, no 4 (4 août 2023) : 2407–24. http://dx.doi.org/10.1137/22m1508352.
Texte intégralThèses sur le sujet "POSTERIORI ALGORITHM"
Ghoumari, Asmaa. « Métaheuristiques adaptatives d'optimisation continue basées sur des méthodes d'apprentissage ». Thesis, Paris Est, 2018. http://www.theses.fr/2018PESC1114/document.
Texte intégralThe problems of continuous optimization are numerous, in economics, in signal processing, in neural networks, and so on. One of the best-known and most widely used solutions is the evolutionary algorithm, a metaheuristic algorithm based on evolutionary theories that borrows stochastic mechanisms and has shown good performance in solving problems of continuous optimization. The use of this family of algorithms is very popular, despite the many difficulties that can be encountered in their design. Indeed, these algorithms have several parameters to adjust and a lot of operators to set according to the problems to solve. In the literature, we find a plethora of operators described, and it becomes complicated for the user to know which one to select in order to have the best possible result. In this context, this thesis has the main objective to propose methods to solve the problems raised without deteriorating the performance of these algorithms. Thus we propose two algorithms:- a method based on the maximum a posteriori that uses diversity probabilities for the operators to apply, and which puts this choice regularly in play,- a method based on a dynamic graph of operators representing the probabilities of transitions between operators, and relying on a model of the objective function built by a neural network to regularly update these probabilities. These two methods are detailed, as well as analyzed via a continuous optimization benchmark
Moon, Kyoung-Sook. « Adaptive Algorithms for Deterministic and Stochastic Differential Equations ». Doctoral thesis, KTH, Numerical Analysis and Computer Science, NADA, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3586.
Texte intégralBekkouche, Fatiha. « Étude théorique et numérique des équations non-linéaires de Sobolev ». Thesis, Valenciennes, 2018. http://www.theses.fr/2018VALE0018/document.
Texte intégralThe purpose of this work is the mathematical study and the numerical analysis of the nonlinear Sobolev problem. A first chapter is devoted to the a priori analysis for the Sobolev problem, where we use an explicit semidiscretization in time. A priori error estimates were obtained ensuring that the used numerical schemes converge when the time step discretization and the spatial step discretization tend to zero. In a second chapter, we are interested in the singularly perturbed Sobolev problem. For the stability of numerical schemes, we used in this part implicit semidiscretizations in time (the Euler method and the Crank-Nicolson method). Our estimates of Chapters 1 and 2 are confirmed in the third chapter by some numerical experiments. In the last chapter, we consider a Sobolev equation and we derive a posteriori error estimates for the discretization of this equation by a conforming finite element method in space and an implicit Euler scheme in time. The upper bound is global in space and time and allows effective control of the global error. At the end of the chapter, we propose an adaptive algorithm which ensures the control of the total error with respect to a user-defined relative precision by refining the meshes adaptively, equilibrating the time and space contributions of the error. We also present numerical experiments
Giacomini, Matteo. « Quantitative a posteriori error estimators in Finite Element-based shape optimization ». Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLX070/document.
Texte intégralGradient-based shape optimization strategies rely on the computation of the so-called shape gradient. In many applications, the objective functional depends both on the shape of the domain and on the solution of a PDE which can only be solved approximately (e.g. via the Finite Element Method). Hence, the direction computed using the discretized shape gradient may not be a genuine descent direction for the objective functional. This Ph.D. thesis is devoted to the construction of a certification procedure to validate the descent direction in gradient-based shape optimization methods using a posteriori estimators of the error due to the Finite Element approximation of the shape gradient.By means of a goal-oriented procedure, we derive a fully computable certified upper bound of the aforementioned error. The resulting Certified Descent Algorithm (CDA) for shape optimization is able to identify a genuine descent direction at each iteration and features a reliable stopping criterion basedon the norm of the shape gradient.Two main applications are tackled in the thesis. First, we consider the scalar inverse identification problem of Electrical Impedance Tomography and we investigate several a posteriori estimators. A first procedure is inspired by the complementary energy principle and involves the solution of additionalglobal problems. In order to reduce the computational cost of the certification step, an estimator which depends solely on local quantities is derived via an equilibrated fluxes approach. The estimators are validated for a two-dimensional case and some numerical simulations are presented to test the discussed methods. A second application focuses on the vectorial problem of optimal design of elastic structures. Within this framework, we derive the volumetric expression of the shape gradient of the compliance using both H 1 -based and dual mixed variational formulations of the linear elasticity equation. Some preliminary numerical tests are performed to minimize the compliance under a volume constraint in 2D using the Boundary Variation Algorithm and an a posteriori estimator of the error in the shape gradient is obtained via the complementary energy principle
Chalhoub, Nancy. « Estimations a posteriori pour l'équation de convection-diffusion-réaction instationnaire et applications aux volumes finis ». Phd thesis, Université Paris-Est, 2012. http://pastel.archives-ouvertes.fr/pastel-00794392.
Texte intégralMoon, Kyoung-Sook. « Convergence rates of adaptive algorithms for deterministic and stochastic differential equations ». Licentiate thesis, KTH, Numerical Analysis and Computer Science, NADA, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-1382.
Texte intégralSánchez, Góez Sebastián. « Algoritmo de reconstrucción analítico para el escáner basado en cristales monolíticos MINDView ». Doctoral thesis, Universitat Politècnica de València, 2021. http://hdl.handle.net/10251/159259.
Texte intégral[CAT] La tomografia per emissió de positrons és una tècnica de medicina nuclear en la qual es genera una imatge a partir de la detecció de raigs gamma en coincidència. Aquests raigs són produïts dins d'un pacient a què se li injecta una radiotraçador emissor de positrons, els quals s'aniquilen amb electrons de l'medi circumdant. El procés de adquición d'esdeveniments d'interacció, té com a unitat central el detector de l'escàner PET, el qual es compon al seu torn d'un vidre de centelleig, encarregat de transformar els raigs gamma incidents en fotons òptics dins el vidre. La finalitat és llavors, determinar les coordenades d'impacte dins el vidre de centelleig amb la major precisió possible, perquè, a partir d'aquests punts, es pugui reconstruir una imatge. Al llarg de la història, els detectors basats en cristalls pixelats han representat l'elecció per excellència per a la la fabricació d'escàners PET. En aquesta tesi s'avalua l'impacte en la resolució espacial de l'escàner PET MINDView, desenvolupat dins el setè programa Marc de la Unió Europea No 603.002, el qual es basa en l'ús de vidres monolítics. L'ús de vidres monolítics, facilita la determinació de la profunditat d'interacció dels raigs gamma incidents, augmenta la precisió en les coordenades d'impacte determinades, i disminueix l'error de parallaxi que s'indueix en cristalls pixelats, a causa de la dificultat per determinar la DOI. En aquesta tesi, hem aconseguit dos objectius principals relacionats amb el mesurament de la resolució espacial de l'escàner MINDView: l'adaptació de l'un algoritme de STIR de Retroprojecció Filtrada en 3D a un escàner basat en cristalls monolítics i la implementació d'un algoritme de Retroprojecció i filtrat a posteriori. Pel que fa a l'adaptació de l'algoritme FBP3DRP, les resolucions espacials obtingudes varien en els intervals [2 mm, 3,4 mm], [2,3 mm, 3,3 mm] i [2,2 mm, 2,3 mm] per les direccions radial, tangencial i axial, respectivament, en el primer prototip de l'escàner MINDView dedicat a cervell. D'altra banda, en la implementació de l'algoritme de tipus BPF, es va realitzar una adquisició d'un maniquí de derenzo i es va comparar la resolució obtinguda amb l'algorisme de FBP3DRP i una implementació de l'algoritme de subconjunts ordenats en mode llista (LMOS - de l'anglès List Mode Ordered Subset). Mitjançant l'algoritme de tipus BPF es van obtenir valors pic-vall de 2.4 al llarg dels cilindres de l'maniquí de 1.6 mm de diàmetre, en contrast amb les mesures obtingudes de 1.34 i 1.44 per als algoritmes de FBP3DRP i LMOS, respectivament. L'anterior es tradueix en que, mitjançant l'algoritme de tipus BPF, s'aconsegueix millorar la resolució per obtenir-se un valor mitjà 1.6 mm.
[EN] Positron Emission Tomography (PET) is a medical imaging technique, in which an image is generated from the detection of gamma rays in coincidence. These rays are produced within a patient, who is injected with a positron emmiter radiotracer, from which positrons are annihilated with electrons in the media. The event acquisition process is focused on the scanner detector. The detector is in turn composed of a scintillation crystal, which transform the incident ray gamma into optical photons within the crystal. The purpose is then to determine the impact coordinates within the scintillation crystal with the greatest possible precision, so that, from these points, an image can be reconstructed. Throughout history, detectors based on pixelated crystals have represented the quintessential choice for PET scanners manufacture. This thesis evaluates the impact on the spatial resolution of the MINDView PET scanner, developed in the seventh Framework program of the European Union No. 603002, which detectors are based on monolithic crystals. The use of monolithic crystals facilitates the determination of the depth of interaction (DOI - Depth Of Interaction) of the incident gamma rays, increases the precision in the determined impact coordinates, and reduces the parallax error induces in pixelated crystals, due to the difficulties in determining DOI. In this thesis, we have achieved two main goals related to the measurement of the spatial resolution of the MINDView PET scanner: the adaptation of an STIR algorithm for Filtered BackProjection 3D Reproyected (FBP3DRP) to a scanner based on monolithic crystals, and the implementation of a BackProjection then Filtered algorithm (BPF). Regarding the FBP algorithm adaptation, we achieved resolutions ranging in the intervals [2 mm, 3.4 mm], [2.3 mm, 3.3 mm] and [2.2 mm, 2.3 mm] for the radial, tangential and axial directions, respectively. On the an acquisition of a derenzo phantom was performed to measure the spacial resolution, which was obtained using three reconstruction algorithms: the BPF-type algorithm, the FBP3DRP algorithm and an implementation of the list-mode ordered subsets algorithm (LMOS). Regarding the BPF-type algorithm, a peak-to-valley value of 2.4 were obtain along rod of 1.6 mm, in contrast to the measurements of 1.34 and 1.44 obtained for the FBP3DRP and LMOS algorithms, respectively. This means that, by means of the BPF-type algorithm, it is possible to improve the resolution to obtain an average value of 1.6 mm.
Sánchez Góez, S. (2020). Algoritmo de reconstrucción analítico para el escáner basado en cristales monolíticos MINDView [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/159259
TESIS
Hu, Ying. « Maximum a posteriori estimation algorithms for image segmentation and restoration ». Thesis, University of Essex, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.317698.
Texte intégralRenaud, Gabriel. « Bayesian maximum a posteriori algorithms for modern and ancient DNA ». Doctoral thesis, Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-195705.
Texte intégralGrosman, Sergey. « Adaptivity in anisotropic finite element calculations ». Doctoral thesis, Universitätsbibliothek Chemnitz, 2006. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200600815.
Texte intégralLivres sur le sujet "POSTERIORI ALGORITHM"
Montgomery, Erwin B. Algorithm for Selecting Electrode Configurations and Stimulation Parameters. Oxford University Press, 2016. http://dx.doi.org/10.1093/med/9780190259600.003.0014.
Texte intégralZahn, Roland, et Alistair Burns. Dementia disorders. Oxford University Press, 2017. http://dx.doi.org/10.1093/med/9780198779803.003.0001.
Texte intégralLiang, Percy, Michael Jordan et Dan Klein. Probabilistic grammars and hierarchical Dirichlet processes. Sous la direction de Anthony O'Hagan et Mike West. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198703174.013.27.
Texte intégralChapitres de livres sur le sujet "POSTERIORI ALGORITHM"
Ghoumari, Asmaa, Amir Nakib et Patrick Siarry. « Maximum a Posteriori Based Evolutionary Algorithm ». Dans Bioinspired Heuristics for Optimization, 301–14. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-95104-1_19.
Texte intégralFrolov, Maxim, et Olga Chistiakova. « Adaptive Algorithm Based on Functional-Type A Posteriori Error Estimate for Reissner-Mindlin Plates ». Dans Lecture Notes in Computational Science and Engineering, 131–41. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14244-5_7.
Texte intégralSun, Zengguo, et Xuejun Peng. « Maximum a Posteriori Despeckling Algorithm of Synthetic Aperture Radar Images with Exponential Prior Distribution ». Dans Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery, 410–18. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-70665-4_47.
Texte intégralChoï, Daniel, Laurent Gallimard et Taoufik Sassi. « A Posteriori Error Estimates for a Neumann-Neumann Domain Decomposition Algorithm Applied to Contact Problems ». Dans Lecture Notes in Computational Science and Engineering, 769–77. Cham : Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-05789-7_74.
Texte intégralRamos, A. L. L., et J. A. Apolinário. « A Lattice Version of the Multichannel Fast QRD Algorithm Based on A Posteriori Backward Errors ». Dans Telecommunications and Networking - ICT 2004, 488–97. Berlin, Heidelberg : Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27824-5_66.
Texte intégralEvensen, Geir, Femke C. Vossepoel et Peter Jan van Leeuwen. « Maximum a Posteriori Solution ». Dans Springer Textbooks in Earth Sciences, Geography and Environment, 27–33. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-96709-3_3.
Texte intégralAzzolini, Damiano, Elena Bellodi et Fabrizio Riguzzi. « MAP Inference in Probabilistic Answer Set Programs ». Dans AIxIA 2022 – Advances in Artificial Intelligence, 413–26. Cham : Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-27181-6_29.
Texte intégralTalagrand, O. « A Posteriori Validation of Assimilation Algorithms ». Dans Data Assimilation for the Earth System, 85–95. Dordrecht : Springer Netherlands, 2003. http://dx.doi.org/10.1007/978-94-010-0029-1_8.
Texte intégralDarbon, Jérôme, Gabriel P. Langlois et Tingwei Meng. « Connecting Hamilton-Jacobi Partial Differential Equations with Maximum a Posteriori and Posterior Mean Estimators for Some Non-convex Priors ». Dans Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging, 1–25. Cham : Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-03009-4_56-1.
Texte intégralDarbon, Jérôme, Gabriel P. Langlois et Tingwei Meng. « Connecting Hamilton-Jacobi Partial Differential Equations with Maximum a Posteriori and Posterior Mean Estimators for Some Non-convex Priors ». Dans Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging, 209–33. Cham : Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-030-98661-2_56.
Texte intégralActes de conférences sur le sujet "POSTERIORI ALGORITHM"
Arora, Kirti, et T. L. Singal. « An Optimized Algorithm Maximum a Posteriori Energy Detection ». Dans 2015 Fifth International Conference on Communication Systems and Network Technologies (CSNT). IEEE, 2015. http://dx.doi.org/10.1109/csnt.2015.49.
Texte intégralHamamura, T., T. Akagi et B. Irie. « An Analytic Word Recognition Algorithm Using a Posteriori Probability ». Dans Ninth International Conference on Document Analysis and Recognition (ICDAR 2007) Vol 2. IEEE, 2007. http://dx.doi.org/10.1109/icdar.2007.4376999.
Texte intégralChoi, Dooseop, Taeg-Hyun An et Taejeong Kim. « Hierarchical motion estimation algorithm based on maximum a posteriori probability ». Dans 2017 IEEE 19th International Workshop on Multimedia Signal Processing (MMSP). IEEE, 2017. http://dx.doi.org/10.1109/mmsp.2017.8122242.
Texte intégralWest, Karen F., Douglas J. Granrath et James R. Lersch. « Use of Additional Constraint Terms in Maximum A Posteriori Super Resolution ». Dans Signal Recovery and Synthesis. Washington, D.C. : Optica Publishing Group, 1992. http://dx.doi.org/10.1364/srs.1992.tud3.
Texte intégralGranrath, Douglas J., Karen F. West, H. Donald Fisher et James Lersch. « Deblurring extended astronomical objects with a maximum-a posteriori/expectation-maximization algorithm ». Dans OSA Annual Meeting. Washington, D.C. : Optica Publishing Group, 1991. http://dx.doi.org/10.1364/oam.1991.mqq4.
Texte intégralOgworonjo, Henry C., et John M. M. Anderson. « An MM-based maximum a posteriori algorithm for GPR image reconstruction ». Dans 2014 IEEE Radar Conference (RadarCon). IEEE, 2014. http://dx.doi.org/10.1109/radar.2014.6875671.
Texte intégralChervova, A. A., G. F. Filaretov et F. F. Pashchenko. « A posteriori Fractal Characteristics Change Point Detecting Algorithm for Time Series ». Dans 2018 IEEE 12th International Conference on Application of Information and Communication Technologies (AICT). IEEE, 2018. http://dx.doi.org/10.1109/icaict.2018.8747092.
Texte intégralHur, Minsung, Jin Yong Choi, Jong-Seob Baek et JongSoo Seo. « Generalized Normalized Gradient Descent Algorithm Based on Estimated a Posteriori Error ». Dans 2008 10th International Conference on Advanced Communication Technology. IEEE, 2008. http://dx.doi.org/10.1109/icact.2008.4493703.
Texte intégralJilkov, Vesselin P., Jeffrey H. Ledet et X. Rong Li. « Constrained multiple model maximum a posteriori estimation using list Viterbi algorithm ». Dans 2017 20th International Conference on Information Fusion (Fusion). IEEE, 2017. http://dx.doi.org/10.23919/icif.2017.8009649.
Texte intégralZheng, Shuai, Jian Chen et Yonghong Kuo. « A new CPM demodulation algorithm based on tilted-phase and posteriori probability ». Dans International Conference on Signal Processing and Communication Technology (SPCT 2022), sous la direction de Sandeep Saxena et Shuwen Xu. SPIE, 2023. http://dx.doi.org/10.1117/12.2673812.
Texte intégralRapports d'organisations sur le sujet "POSTERIORI ALGORITHM"
Gungor, Osman, Imad Al-Qadi et Navneet Garg. Pavement Data Analytics for Collected Sensor Data. Illinois Center for Transportation, octobre 2021. http://dx.doi.org/10.36501/0197-9191/21-034.
Texte intégral