Auswahl der wissenschaftlichen Literatur zum Thema „Generic decoding“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Generic decoding" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Generic decoding"
Guobin Shen, Guang-Ping Gao, Shipeng Li, Heung-Yeung Shum und Ya-Qin Zhang. „Accelerate video decoding with generic GPU“. IEEE Transactions on Circuits and Systems for Video Technology 15, Nr. 5 (Mai 2005): 685–93. http://dx.doi.org/10.1109/tcsvt.2005.846440.
Der volle Inhalt der QuelleLax, R. F. „Generic interpolation polynomial for list decoding“. Finite Fields and Their Applications 18, Nr. 1 (Januar 2012): 167–78. http://dx.doi.org/10.1016/j.ffa.2011.07.007.
Der volle Inhalt der QuelleKushnerov, Alexander V., und Valery A. Lipnitski. „Generic BCH codes. Polynomial-norm error decoding“. Journal of the Belarusian State University. Mathematics and Informatics, Nr. 2 (30.07.2020): 36–48. http://dx.doi.org/10.33581/2520-6508-2020-2-36-48.
Der volle Inhalt der QuelleDupuis, Frédéric, Jan Florjanczyk, Patrick Hayden und Debbie Leung. „The locking-decoding frontier for generic dynamics“. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 469, Nr. 2159 (08.11.2013): 20130289. http://dx.doi.org/10.1098/rspa.2013.0289.
Der volle Inhalt der QuelleJouguet, Paul, und Sebastien Kunz-Jacques. „High performance error correction for quantum key distribution using polar codes“. Quantum Information and Computation 14, Nr. 3&4 (März 2014): 329–38. http://dx.doi.org/10.26421/qic14.3-4-8.
Der volle Inhalt der QuelleXu, Liyan, Fabing Duan, Xiao Gao, Derek Abbott und Mark D. McDonnell. „Adaptive recursive algorithm for optimal weighted suprathreshold stochastic resonance“. Royal Society Open Science 4, Nr. 9 (September 2017): 160889. http://dx.doi.org/10.1098/rsos.160889.
Der volle Inhalt der QuelleFlorescu, Dorian, und Daniel Coca. „A Novel Reconstruction Framework for Time-Encoded Signals with Integrate-and-Fire Neurons“. Neural Computation 27, Nr. 9 (September 2015): 1872–98. http://dx.doi.org/10.1162/neco_a_00764.
Der volle Inhalt der QuelleLi, Yinan, Jianan Lu und Badrish Chandramouli. „Selection Pushdown in Column Stores using Bit Manipulation Instructions“. Proceedings of the ACM on Management of Data 1, Nr. 2 (13.06.2023): 1–26. http://dx.doi.org/10.1145/3589323.
Der volle Inhalt der QuelleRybalov, A. N. „On the generic complexity of the decoding problem for linear codes“. Prikladnaya diskretnaya matematika. Prilozhenie, Nr. 12 (01.09.2019): 198–202. http://dx.doi.org/10.17223/2226308x/12/56.
Der volle Inhalt der QuelleJia, Xiaojun, und Zihao Liu. „One-Shot M-Array Pattern Based on Coded Structured Light for Three-Dimensional Object Reconstruction“. Journal of Control Science and Engineering 2021 (02.06.2021): 1–16. http://dx.doi.org/10.1155/2021/6676704.
Der volle Inhalt der QuelleDissertationen zum Thema "Generic decoding"
Florjanczyk, Jan. „The locking-decoding frontier for generic dynamics“. Thesis, McGill University, 2011. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=106400.
Der volle Inhalt der QuelleL'intuition que le montant des corrélations classiques entre deux systèmes sont limités par leur taille est incorrect en général pour les états quantiques. En cas de verrouillage, des mesures sur une paire de systèmes quantiques qui semblent être totalement décorrélées peuvent devenir corrélées au maximum avec une minuscule augmentation de la taille d'un des systèmes. Une nouvelle forme de verrouillage utilisant des canaux unitaire génériques est introduite et la définition de verrouillage est renforcée a base d'une mesure d'indiscernabilité. La nouvelle définition montre que l'information classique peut être arbitrairement bas jusqu'à ce qu'elle puisse être complètement décodée. Aux contraire des résultats précédents, des messages non-uniforme et l'intrication entre la paire de systèmes sont considérés. Auparavant, il était nécessaire d'avoir un registre explicite pour une "clé", cette nécessité est supprimée en faveure d'un sous-système quantique arbitraire. De plus, les résultats précédent considéraient que les mesures projective mais nous démontrons des effets de verrouillage même dans le cas où le récepteur est armé avec les mesures les plus générales. Nous trouvons l'effet de verrouillage générique et montrons des applications pour la sécurité entropique et pour un modèl d'évaporation des trous noirs.
Mahmudi, Ali. „The investigation into generic VHDL implementation of generalised minimum distance decoding for Reed Solomon codes“. Thesis, University of Huddersfield, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.417302.
Der volle Inhalt der QuelleLeuschner, Jeff. „A new generic maximum-likelihood metric expression for space-time block codes with applications to decoding“. Thesis, Kingston, Ont. : [s.n.], 2007. http://hdl.handle.net/1974/633.
Der volle Inhalt der QuelleShi, Aishan. „Decoding the Genetic Code: Unraveling the Language of Scientific Paradigms“. Thesis, The University of Arizona, 2013. http://hdl.handle.net/10150/297762.
Der volle Inhalt der QuelleHalsteinli, Erlend. „Real-Time JPEG2000 Video Decoding on General-Purpose Computer Hardware“. Thesis, Norwegian University of Science and Technology, Department of Electronics and Telecommunications, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-8996.
Der volle Inhalt der QuelleThere is widespread use of compression in multimedia content delivery, e.g. within video on demand services and transport links between live events and production sites. The content must undergo compression prior to transmission in order to deliver high quality video and audio over most networks, this is especially true for high definition video content. JPEG2000 is a recent image compression standard and a suitable compression algorithm for high definition, high rate video. With its highly flexible embedded lossless and lossy compression scheme, JPEG2000 has a number of advantages over existing video codecs. The only evident drawbacks with respect to real-time applications, are that the computational complexity is quite high and that JPEG2000, being an image compression codec as opposed to video codec, typically has higher bandwidth requirements. Special-purpose hardware can deliver high performance, but is expensive and not easily updated. A JPEG2000 decoder application running on general-purpose computer hardware can complement solutions depending on special-purpose hardware and will experience performance scaling together with the available processing power. In addition, production costs will be none-existing, once developed. The application implemented in this project is a streaming media player. It receives a compressed video stream through an IP interface, decodes it frame by frame and presents the decoded frames in a window. The decoder is designed to better take advantage of the processing power available in today's desktop computers. Specifically, decoding is performed on both CPU and GPU in order to decode minimum 50 frames per second of a 720p JPEG2000 video stream. The CPU executed part of the decoder application is written in C++, based on the Kakadu SDK and involve all decoding steps up to and including reverse wavelet transform. The GPU executed part of the decoder is enabled by the CUDA programming language, and include luma upsampling and irreversible color transform. Results indicate that general purpose computer hardware today easily can decode JPEG2000 video at bit rates up to 45 Mbit/s. However, when the video stream is received at 50 fps through the IP interface, packet loss at the socket level limits the attained frame rate to about 45 fps at rates of 40 Mbit/s or lower. If this packet loss could be eliminated, real-time decoding would be obtained up to 40 Mbit/s. At rates above 40 Mbit/s, the attained frame rate is limited by the decoder performance and not the packet loss. Higher codestream rates should be endurable if reverse wavelet transform could be mapped from the CPU to the GPU, since the current pipeline is highly unbalanced.
Kessy, Regina. „Decoding the donor gaze : documentary, aid and AIDS in Africa“. Thesis, University of Huddersfield, 2014. http://eprints.hud.ac.uk/id/eprint/23747/.
Der volle Inhalt der QuelleAl-Wasity, Salim Mohammed Hussein. „Application of fMRI for action representation : decoding, aligning and modulating“. Thesis, University of Glasgow, 2018. http://theses.gla.ac.uk/30761/.
Der volle Inhalt der QuelleCarrier, Kevin. „Recherche de presque-collisions pour le décodage et la reconnaissance de codes correcteurs“. Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS281.
Der volle Inhalt der QuelleError correcting codes are tools whose initial function is to correct errors caused by imperfect communication channels. In a non-cooperative context, there is the problem of identifying unknown codes based solely on knowledge of noisy codewords. This problem can be difficult for certain code families, in particular LDPC codes which are very common in modern telecommunication systems. In this thesis, we propose new techniques to more easily recognize these codes. At the end of the 1970s, McEliece had the idea of redirecting the original function of codes to use in ciphers; thus initiating a family of cryptographic solutions which is an alternative to those based on number theory problems. One of the advantages of code-based cryptography is that it seems to withstand the quantum computing paradigm; notably thanks to the robustness of the generic decoding problem. The latter has been thoroughly studied for more than 60 years. The latest improvements all rely on using algorithms for finding pairs of points that are close to each other in a list. This is the so called near-collisions search problem. In this thesis, we improve the generic decoding by asking in particular for a new way to find close pairs. To do this, we use list decoding of Arikan's polar codes to build new fuzzy hashing functions. In this manuscript, we also deal with the search for pairs of far points. Our solution can be used to improve decoding over long distances. This new type of decoding finds very recent applications in certain signature models
Ramis, Zaldívar Juan Enrique. „Decoding the genetic landscape of pediatric and young adult germinal center-derived B-cell non-Hodgkin lymphoma“. Doctoral thesis, Universitat de Barcelona, 2021. http://hdl.handle.net/10803/672372.
Der volle Inhalt der QuelleKamel, Ehab. „Decoding cultural landscapes : guiding principles for the management of interpretation in cultural world heritage sites“. Thesis, University of Nottingham, 2011. http://eprints.nottingham.ac.uk/11845/.
Der volle Inhalt der QuelleBücher zum Thema "Generic decoding"
Decoding your dreams. New York: H. Holt, 1988.
Den vollen Inhalt der Quelle findenDecoding your dreams. London: Unwin Hyman, 1989.
Den vollen Inhalt der Quelle findenLangs, Robert. Decoding your dreams. London: Unwin Paperbacks, 1990.
Den vollen Inhalt der Quelle findenF, Gesteland Raymond, und SpringerLink (Online service), Hrsg. Recoding: Expansion of Decoding Rules Enriches Gene Expression. New York, NY: Springer Science+Business Media, LLC, 2010.
Den vollen Inhalt der Quelle findenBerghoff, Hartmut. Decoding Modern Consumer Societies. New York: Palgrave Macmillan, 2012.
Den vollen Inhalt der Quelle findenDecoding the past: The psychohistorical approach. New Brunswick, N.J., U.S.A: Transaction Publishers, 1996.
Den vollen Inhalt der Quelle findenDecoding the past: The psychohistorical approach. Berkeley: University of California Press, 1985.
Den vollen Inhalt der Quelle findenTanzi, Rudolph E. Decoding darkness: The search for the genetic causes of Alzheimer's disease. Cambridge, Mass: Perseus Publishing, 2000.
Den vollen Inhalt der Quelle findenTanzi, Rudolph E. Decoding darkness: The search for the genetic causes of Alzheimer's disease. Cambridge, Mass: Perseus Pub., 2000.
Den vollen Inhalt der Quelle findenB, Parson Ann, Hrsg. Decoding darkness: The search for the genetic causes of Alzheimer's disease. Cambridge, Mass: Perseus Publ., 2000.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "Generic decoding"
Dupuis, Frédéric, Jan Florjanczyk, Patrick Hayden und Debbie Leung. „The Locking-Decoding Frontier for Generic Dynamics“. In Theory of Quantum Computation, Communication, and Cryptography, 23–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54429-3_3.
Der volle Inhalt der QuelleSheng, Mingyang, Yongqiang Ma, Kai Chen und Nanning Zheng. „VAE-Based Generic Decoding via Subspace Partition and Priori Utilization“. In IFIP Advances in Information and Communication Technology, 220–32. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-34107-6_18.
Der volle Inhalt der QuellePapadimitriou, Angeliki, Nikolaos Passalis und Anastasios Tefas. „Decoding Generic Visual Representations from Human Brain Activity Using Machine Learning“. In Lecture Notes in Computer Science, 597–606. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-11015-4_45.
Der volle Inhalt der QuelleCassagne, Adrien, Bertrand Le Gal, Camille Leroux, Olivier Aumage und Denis Barthou. „An Efficient, Portable and Generic Library for Successive Cancellation Decoding of Polar Codes“. In Languages and Compilers for Parallel Computing, 303–17. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29778-1_19.
Der volle Inhalt der QuelleChailloux, André, Thomas Debris-Alazard und Simona Etinski. „Classical and Quantum Algorithms for Generic Syndrome Decoding Problems and Applications to the Lee Metric“. In Post-Quantum Cryptography, 44–62. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81293-5_3.
Der volle Inhalt der QuelleVinuesa, Carola G., und Matthew C. Cook. „Genetic Analysis of Systemic Autoimmunity“. In Decoding the Genomic Control of Immune Reactions, 103–28. Chichester, UK: John Wiley & Sons, Ltd, 2007. http://dx.doi.org/10.1002/9780470062128.ch10.
Der volle Inhalt der QuelleKeeling, Kim M., und David M. Bedwell. „Recoding Therapies for Genetic Diseases“. In Recoding: Expansion of Decoding Rules Enriches Gene Expression, 123–46. New York, NY: Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-89382-2_6.
Der volle Inhalt der QuelleFarabaugh, Philip J. „Programmed Alternative Decoding as Programmed Translational Errors“. In Programmed Alternative Reading of the Genetic Code, 183–201. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-5999-3_9.
Der volle Inhalt der QuelleKarupiah, Gunasegaran, Vijay Panchanathan, Isaac G. Sakala und Geeta Chaudhri. „Genetic Resistance to Smallpox: Lessons from Mousepox“. In Decoding the Genomic Control of Immune Reactions, 129–40. Chichester, UK: John Wiley & Sons, Ltd, 2007. http://dx.doi.org/10.1002/9780470062128.ch11.
Der volle Inhalt der QuelleMin-Oo, Gundula, Mary M. Stevenson, Anny Fortin und Philippe Gros. „Genetic Control of Host-Pathogen Interactions in Mice“. In Decoding the Genomic Control of Immune Reactions, 156–68. Chichester, UK: John Wiley & Sons, Ltd, 2007. http://dx.doi.org/10.1002/9780470062128.ch13.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Generic decoding"
Bitzer, Sebastian, Alessio Pavoni, Violetta Weger, Paolo Santini, Marco Baldi und Antonia Wachter-Zeh. „Generic Decoding of Restricted Errors“. In 2023 IEEE International Symposium on Information Theory (ISIT). IEEE, 2023. http://dx.doi.org/10.1109/isit54713.2023.10206983.
Der volle Inhalt der QuelleBitzer, Sebastian, Julian Renner, Antonia Wachter-Zeh und Violetta Weger. „Generic Decoding in the Cover Metric“. In 2023 IEEE Information Theory Workshop (ITW). IEEE, 2023. http://dx.doi.org/10.1109/itw55543.2023.10160246.
Der volle Inhalt der QuellePuchinger, Sven, Julian Renner und Johan Rosenkilde. „Generic Decoding in the Sum-Rank Metric“. In 2020 IEEE International Symposium on Information Theory (ISIT). IEEE, 2020. http://dx.doi.org/10.1109/isit44484.2020.9174497.
Der volle Inhalt der QuelleBrakensiek, Joshua, Sivakanth Gopi und Visu Makam. „Generic Reed-Solomon Codes Achieve List-Decoding Capacity“. In STOC '23: 55th Annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3564246.3585128.
Der volle Inhalt der Quelle„HDL LIBRARY OF PROCESSING UNITS FOR GENERIC AND DVB-S2 LDPC DECODING“. In International Conference on Security and Cryptography. SciTePress - Science and and Technology Publications, 2006. http://dx.doi.org/10.5220/0001570000170024.
Der volle Inhalt der QuelleHou, TianQi, YuHao Liu, Teng Fu und Jean Barbier. „Sparse superposition codes under VAMP decoding with generic rotational invariant coding matrices“. In 2022 IEEE International Symposium on Information Theory (ISIT). IEEE, 2022. http://dx.doi.org/10.1109/isit50566.2022.9834843.
Der volle Inhalt der QuelleJanakiram, Balaji, M. Girish Chandra, B. S. Adiga, S. G. Harihara und P. Balamuralidhar. „A generic conflict-free architecture for decoding LDPC codes using Perfect Difference Networks“. In 2010 Australian Communications Theory Workshop (AusCTW). IEEE, 2010. http://dx.doi.org/10.1109/ausctw.2010.5426777.
Der volle Inhalt der QuelleLeuschner, Jeff, und Shahram Yousefi. „A New Generic Maximum-Likelihood Metric Expression for Space-Time Block Codes With Applications To Decoding“. In 2007 41st Annual Conference on Information Sciences and Systems. IEEE, 2007. http://dx.doi.org/10.1109/ciss.2007.4298429.
Der volle Inhalt der QuelleArava, V. K. Prasad, Manhwee Jo, HyoukJoong Lee und Kiyoung Choi. „A Generic Design for Encoding and Decoding Variable Length Codes in Multi-codec Video Processing Engines“. In 2008 IEEE Computer Society Annual Symposium on VLSI. IEEE, 2008. http://dx.doi.org/10.1109/isvlsi.2008.49.
Der volle Inhalt der QuelleQian, Qiao, Minlie Huang, Haizhou Zhao, Jingfang Xu und Xiaoyan Zhu. „Assigning Personality/Profile to a Chatting Machine for Coherent Conversation Generation“. In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/595.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Generic decoding"
Loughry, Thomas A. General Purpose Graphics Processing Unit Based High-Rate Rice Decompression and Reed-Solomon Decoding. Office of Scientific and Technical Information (OSTI), Februar 2015. http://dx.doi.org/10.2172/1170513.
Der volle Inhalt der QuelleZhang, Hongbin, Shahal Abbo, Weidong Chen, Amir Sherman, Dani Shtienberg und Frederick Muehlbauer. Integrative Physical and Genetic Mapping of the Chickpea Genome for Fine Mapping and Analysis of Agronomic Traits. United States Department of Agriculture, März 2010. http://dx.doi.org/10.32747/2010.7592122.bard.
Der volle Inhalt der Quelle