Littérature scientifique sur le sujet « Local decoding »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
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 « Local decoding ».
À 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 "Local decoding"
Jackson, Andrew, et Thomas M. Hall. « Decoding Local Field Potentials for Neural Interfaces ». IEEE Transactions on Neural Systems and Rehabilitation Engineering 25, no 10 (octobre 2017) : 1705–14. http://dx.doi.org/10.1109/tnsre.2016.2612001.
Texte intégralScruby, T. R., et K. Nemoto. « Local Probabilistic Decoding of a Quantum Code ». Quantum 7 (29 août 2023) : 1093. http://dx.doi.org/10.22331/q-2023-08-29-1093.
Texte intégralHu, Lehua. « Coding and Decoding Optimization of Remote Video Surveillance Systems ». International Journal of Grid and High Performance Computing 15, no 2 (16 février 2023) : 1–15. http://dx.doi.org/10.4018/ijghpc.318405.
Texte intégralIslam, Mohammad S., Khondaker A. Mamun et Hai Deng. « Decoding of Human Movements Based on Deep Brain Local Field Potentials Using Ensemble Neural Networks ». Computational Intelligence and Neuroscience 2017 (2017) : 1–16. http://dx.doi.org/10.1155/2017/5151895.
Texte intégralBaranov, Pavel V., John F. Atkins et Martina M. Yordanova. « Augmented genetic decoding : global, local and temporal alterations of decoding processes and codon meaning ». Nature Reviews Genetics 16, no 9 (11 août 2015) : 517–29. http://dx.doi.org/10.1038/nrg3963.
Texte intégralAdjemov, S. S., A. I. Kostogryzov et A. O. Atakishchev. « METAGRAMMATICAL MODEL AND METHOD OF DECODING THE VIDEOGRAPHICAL INFORMATION WITH PREFIX COMPRESSION CODES ». Vestnik komp'iuternykh i informatsionnykh tekhnologii, no 193 (juillet 2020) : 24–33. http://dx.doi.org/10.14489/vkit.2020.07.pp.024-033.
Texte intégralAdjemov, S. S., A. I. Kostogryzov et A. O. Atakishchev. « METAGRAMMATICAL MODEL AND METHOD OF DECODING THE VIDEOGRAPHICAL INFORMATION WITH PREFIX COMPRESSION CODES ». Vestnik komp'iuternykh i informatsionnykh tekhnologii, no 193 (juillet 2020) : 24–33. http://dx.doi.org/10.14489/vkit.2020.07.pp.024-033.
Texte intégralPrakash, Surya S., J. Patrick Mayo et Supratim Ray. « Decoding of attentional state using local field potentials ». Current Opinion in Neurobiology 76 (octobre 2022) : 102589. http://dx.doi.org/10.1016/j.conb.2022.102589.
Texte intégralGur, Tom, et Oded Lachish. « On the Power of Relaxed Local Decoding Algorithms ». SIAM Journal on Computing 50, no 2 (janvier 2021) : 788–813. http://dx.doi.org/10.1137/19m1307834.
Texte intégralHanks, Michael, William J. Munro et Kae Nemoto. « Decoding Quantum Error Correction Codes With Local Variation ». IEEE Transactions on Quantum Engineering 1 (2020) : 1–8. http://dx.doi.org/10.1109/tqe.2020.2967890.
Texte intégralThèses sur le sujet "Local decoding"
Grigorescu, Elena Ph D. Massachusetts Institute of Technology. « Local list decoding of homomorphisms ». Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/37929.
Texte intégralIncludes bibliographical references (leaves 47-49).
We investigate the local-list decodability of codes whose codewords are group homomorphisms. The study of such codes was intiated by Goldreich and Levin with the seminal work on decoding the Hadamard code. Many of the recent abstractions of their initial algorithm focus on Locally Decodable Codes (LDC's) over finite fields. We derive our algorithmic approach from the list decoding of the Reed-Muller code over finite fields proposed by Sudan, Trevisan and Vadhan. Given an abelian group G and a fixed abelian group H, we give combinatorial bounds on the number of homomorphisms that have agreement 6 with an oracle-access function f : G --> H. Our bounds are polynomial in , where the degree of the polynomial depends on H. Also, depends on the distance parameter of the code, namely we consider to be slightly greater than 1-minimum distance. Furthermore, we give a local-list decoding algorithm for the homomorphisms that agree on a 3 fraction of the domain with a function f, the running time of which is poly(1/e, log G).
by Elena Grigorescu.
S.M.
Ross, Max. « Decoding museum gazes : a study of visitors to local museums ». Thesis, Keele University, 2003. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.409554.
Texte intégralGrouès, Lucien. « Decoding of LDPC quantum codes ». Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS413.
Texte intégralTo be able to perform useful computations employing quantum computers we need to make quantum information more robust against noise. One promising approach is to protect the information using quantum LDPC codes, however they are useless without a powerful decoder. In this thesis we will study the decoding of LDPC quantum codes, and in particular of hypergraph product codes with several decoders. We first study a decoder solely focused on performance obtained from the combination of two already existing decoders, BP and SSF. We show through simulations that it has improved performance on random hypergraph product codes compared to each of the decoders alone. Later we concentrate on a decoder easier to analyse which exhibits interesting theoretical guarantees by continuing the work started by Li and Vontobel of importing the LP decoder to quantum error correction. We manage to prove negative results affecting the asymptotic performance on several LDPC quantum codes, while showing that it still performs well on hypergraph product codes of realistic size. Finally we focus on local decoders for the decoding of quantum LDPC code. In particular we numerically study a parallel variant of SSF in its fastest and most local implementation
Tanniou, Sophie Nicole Isabelle. « Decoding identities in 'Francophone' African postcolonial spaces : local novels, global narratives ». Thesis, University of Birmingham, 2015. http://etheses.bham.ac.uk//id/eprint/6360/.
Texte intégralCarey, Michael Clay. « Telling Us What We Already Know : A Case Study Analysis of Poverty Coverage in Rural Appalachian Community News Outlets ». Ohio University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1406844451.
Texte intégralShams, Bilal. « Codes LDPC non-binaire de nouvelle generation ». Phd thesis, Université de Cergy Pontoise, 2010. http://tel.archives-ouvertes.fr/tel-00766409.
Texte intégralHardmeier, Christian. « Discourse in Statistical Machine Translation ». Doctoral thesis, Uppsala universitet, Institutionen för lingvistik och filologi, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-223798.
Texte intégralMarie, Benjamin. « Exploitation d’informations riches pour guider la traduction automatique statistique ». Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS066/document.
Texte intégralAlthough communication between languages has without question been made easier thanks to Machine Translation (MT), especially given the recent advances in statistical MT systems, the quality of the translations produced by MT systems is still well below the translation quality that can be obtained through human translation. This gap is partly due to the way in which statistical MT systems operate; the types of models that can be used are limited because of the need to construct and evaluate a great number of partial hypotheses to produce a complete translation hypothesis. While more “complex” models learnt from richer information do exist, in practice, their integration into the system is not always possible, would necessitate a complete hypothesis to be computed or would be too computationally expensive. Such features are therefore typically used in a reranking step applied to the list of the best complete hypotheses produced by the MT system.Using these features in a reranking framework does often provide a better modelization of certain aspects of the translation. However, this approach is inherently limited: reranked hypothesis lists represent only a small portion of the decoder's search space, tend to contain hypotheses that vary little between each other and which were obtained with features that may be very different from the complex features to be used during reranking.In this work, we put forward the hypothesis that such translation hypothesis lists are poorly adapted for exploiting the full potential of complex features. The aim of this thesis is to establish new and better methods of exploiting such features to improve translations produced by statistical MT systems.Our first contribution is a rewriting system guided by complex features. Sequences of rewriting operations, applied to hypotheses obtained by a reranking framework that uses the same features, allow us to obtain a substantial improvement in translation quality.The originality of our second contribution lies in the construction of hypothesis lists with a multi-pass decoding that exploits information derived from the evaluation of previously translated hypotheses, using a set of complex features. Our system is therefore capable of producing more diverse hypothesis lists, which are globally of a better quality and which are better adapted to a reranking step with complex features. What is more, our forementioned rewriting system enables us to further improve the hypotheses produced with our multi-pass decoding approach.Our third contribution is based on the simulation of an ideal information type, designed to perfectly identify the correct fragments of a translation hypothesis. This perfect information gives us an indication of the best attainable performance with the systems described in our first two contributions, in the case where the complex features are able to modelize the translation perfectly. Through this approach, we also introduce a novel form of interactive translation, coined "pre-post-editing", under a very simplified form: a statistical MT system produces its best translation hypothesis, then a human indicates which fragments of the hypothesis are correct, and this new information is then used during a new decoding pass to find a new best translation
Patthak, Anindya Chandra 1977. « Error correcting codes : local testing, list decoding, and applications ». Thesis, 2007. http://hdl.handle.net/2152/3626.
Texte intégralTadipatri, Vijay Aditya. « Developing robust movement decoders for local field potentials ». Thesis, 2015. http://hdl.handle.net/2152/31016.
Texte intégraltext
Livres sur le sujet "Local decoding"
Decoding America's ancient indian languages. San Diego, CA : Anasazi Publishing Group, 2007.
Trouver le texte intégralRowedder, Simon. Cross-Border Traders in Northern Laos. Nieuwe Prinsengracht 89 1018 VR Amsterdam Nederland : Amsterdam University Press, 2022. http://dx.doi.org/10.5117/9789463722360.
Texte intégralSacred Land : Decoding the Hidden History of Britain. Little, Brown Book Group Limited, 2012.
Trouver le texte intégralPalmer, Martin. Sacred Land : Decoding Britain's Extraordinary Past Through Its Towns, Villages and Countryside. Little, Brown Book Group Limited, 2012.
Trouver le texte intégralYaari, Nurit. Israeli Theatre. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198746676.003.0012.
Texte intégralChapitres de livres sur le sujet "Local decoding"
Grigorescu, Elena, Swastik Kopparty et Madhu Sudan. « Local Decoding and Testing for Homomorphisms ». Dans Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 375–85. Berlin, Heidelberg : Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11830924_35.
Texte intégralHatami, Pooya, et Madhur Tulsiani. « Approximate Local Decoding of Cubic Reed-Muller Codes Beyond the List Decoding Radius ». Dans Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 663–79. Philadelphia, PA : Society for Industrial and Applied Mathematics, 2018. http://dx.doi.org/10.1137/1.9781611975031.43.
Texte intégralGur, Tom, et Oded Lachish. « On the Power of Relaxed Local Decoding Algorithms ». Dans Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1377–94. Philadelphia, PA : Society for Industrial and Applied Mathematics, 2020. http://dx.doi.org/10.1137/1.9781611975994.83.
Texte intégralKuditchar, Nene-Lomotey. « Decoding the Paradox of Decentralization with Centralized Characteristics in Democratic Ghana ». Dans Democratic Decentralization, Local Governance and Sustainable Development, 43–62. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-12378-8_3.
Texte intégralMollas, Ioannis, Nikolaos Bassiliades et Grigorios Tsoumakas. « LioNets : Local Interpretation of Neural Networks Through Penultimate Layer Decoding ». Dans Machine Learning and Knowledge Discovery in Databases, 265–76. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43823-4_23.
Texte intégralWatanabe, Osamu, Takeshi Sawai et Hayato Takahashi. « Analysis of a Randomized Local Search Algorithm for LDPCC Decoding Problem ». Dans Stochastic Algorithms : Foundations and Applications, 50–60. Berlin, Heidelberg : Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39816-5_5.
Texte intégralHong, Zhang, et Wu Ping. « Image Classification with Local Linear Decoding and Global Multi-feature Fusion ». Dans Lecture Notes in Computer Science, 437–46. Cham : Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24078-7_44.
Texte intégralKasami, Tadao, Hitoshi Tokushige et Yuichi Kaji. « Sufficient Conditions on Most Likely Local Sub-codewords in Recursive Maximum Likelihood Decoding Algorithms ». Dans Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 333–42. Berlin, Heidelberg : Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45624-4_35.
Texte intégralvan Breugel, Maria Elize, et Fred van Leeuwen. « Epi-Decoder : Decoding the Local of a Genomic Locus by Massive Combined with DNA-Barcode Sequencing ». Dans Methods in Molecular Biology, 123–50. New York, NY : Springer US, 2022. http://dx.doi.org/10.1007/978-1-0716-2140-0_8.
Texte intégralZhang, Shuai, Juan F. Quinonez-Beltran, Jialin Lai, Pooja R. Nakamura, John A. Downes, Carlos J. Manuel et R. Malatesha Joshi. « Expressive Language Proficiency and Decoding Development in Local Languages and Portuguese in Mozambique : Evidence from Nampula and Zambézia ». Dans Literacy Studies, 507–28. Cham : Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-26250-0_23.
Texte intégralActes de conférences sur le sujet "Local decoding"
Rachkidy, Nancy El, Alexre Guitton et Megumi Kaneko. « Decoding Superposed LoRa Signals ». Dans 2018 IEEE 43rd Conference on Local Computer Networks (LCN). IEEE, 2018. http://dx.doi.org/10.1109/lcn.2018.8638253.
Texte intégralZhu, Ziyuan, Wei Wu et Paul H. Siegel. « Polar Codes with Local-Global Decoding ». Dans 2022 56th Asilomar Conference on Signals, Systems, and Computers. IEEE, 2022. http://dx.doi.org/10.1109/ieeeconf56349.2022.10051996.
Texte intégralLindberg, Eric W., Lee E. Miller, Emily R. Oby et Marc W. Slutzky. « Decoding muscle activity with local field potentials ». Dans 5th International IEEE/EMBS Conference on Neural Engineering (NER 2011). IEEE, 2011. http://dx.doi.org/10.1109/ner.2011.5910541.
Texte intégralDingel, Janis, Nikhil Singh et Olgica Milenkovic. « Inferring algebraic gene networks using local decoding ». Dans 2008 IEEE International Conference on Bioinformatics and Biomeidcine Workshops, BIBMW. IEEE, 2008. http://dx.doi.org/10.1109/bibmw.2008.4686224.
Texte intégralJensen, Arne S. « Decoding of stereo images by local correlation ». Dans SPIE's 1995 International Symposium on Optical Science, Engineering, and Instrumentation, sous la direction de Robert A. Melter, Angela Y. Wu, Fred L. Bookstein et William D. K. Green. SPIE, 1995. http://dx.doi.org/10.1117/12.216411.
Texte intégralRam, Eshed, et Yuval Cassuto. « LDPC Codes with Local and Global Decoding ». Dans 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, 2018. http://dx.doi.org/10.1109/isit.2018.8437736.
Texte intégralVatedka, Shashank, et Aslan Tchamkerten. « Local Decoding and Update of Compressed Data ». Dans 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849634.
Texte intégralZhou, Wangchunshu, Tao Ge et Ke Xu. « Pseudo-Bidirectional Decoding for Local Sequence Transduction ». Dans Findings of the Association for Computational Linguistics : EMNLP 2020. Stroudsburg, PA, USA : Association for Computational Linguistics, 2020. http://dx.doi.org/10.18653/v1/2020.findings-emnlp.136.
Texte intégralAdegbite, S. A., S. G. Mcmeekin et B. G. Stewart. « Improved PCFICH decoding in LTE systems ». Dans 2015 IEEE International Workshop on Local and Metropolitan Area Networks (LANMAN). IEEE, 2015. http://dx.doi.org/10.1109/lanman.2015.7114739.
Texte intégralRyu, Junhee, Kyungtae Kang, Yongwoo Cho, Joonho Lee et Heonshik Shin. « Energy Characterization of Reed-Solomon Decoding in 3G Broadcasting ». Dans 2006 31st IEEE Conference on Local Computer Networks. IEEE, 2006. http://dx.doi.org/10.1109/lcn.2006.322043.
Texte intégral