Добірка наукової літератури з теми "Coded Computation"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Coded Computation".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Coded Computation"
Kim, Minchul, and Jungwoo Lee. "Private Secure Coded Computation." IEEE Communications Letters 23, no. 11 (November 2019): 1918–21. http://dx.doi.org/10.1109/lcomm.2019.2934436.
Повний текст джерелаKosaian, Jack, K. V. Rashmi, and Shivaram Venkataraman. "Learning-Based Coded Computation." IEEE Journal on Selected Areas in Information Theory 1, no. 1 (May 2020): 227–36. http://dx.doi.org/10.1109/jsait.2020.2983165.
Повний текст джерелаJia, Zhuqing, and Syed Ali Jafar. "Cross Subspace Alignment Codes for Coded Distributed Batch Computation." IEEE Transactions on Information Theory 67, no. 5 (May 2021): 2821–46. http://dx.doi.org/10.1109/tit.2021.3064827.
Повний текст джерелаReisizadeh, Amirhossein, Saurav Prakash, Ramtin Pedarsani, and Amir Salman Avestimehr. "Coded Computation Over Heterogeneous Clusters." IEEE Transactions on Information Theory 65, no. 7 (July 2019): 4227–42. http://dx.doi.org/10.1109/tit.2019.2904055.
Повний текст джерелаChen, Li, Kaifeng Han, Ying Du, and Zhiqin Wang. "Block-Division-Based Wireless Coded Computation." IEEE Wireless Communications Letters 11, no. 2 (February 2022): 283–87. http://dx.doi.org/10.1109/lwc.2021.3125983.
Повний текст джерелаOzfatura, Emre, Sennur Ulukus, and Deniz Gündüz. "Straggler-Aware Distributed Learning: Communication–Computation Latency Trade-Off." Entropy 22, no. 5 (May 13, 2020): 544. http://dx.doi.org/10.3390/e22050544.
Повний текст джерелаObead, Sarah A., Hsuan-Yin Lin, Eirik Rosnes, and Jorg Kliewer. "Private Linear Computation for Noncolluding Coded Databases." IEEE Journal on Selected Areas in Communications 40, no. 3 (March 2022): 847–61. http://dx.doi.org/10.1109/jsac.2022.3142362.
Повний текст джерелаHong, Sangwoo, Heecheol Yang, and Jungwoo Lee. "Squeezed Polynomial Codes: Communication-Efficient Coded Computation in Straggler-Exploiting Distributed Matrix Multiplication." IEEE Access 8 (2020): 190516–28. http://dx.doi.org/10.1109/access.2020.3031590.
Повний текст джерелаMoritaka, Kiyoshi, and Tomonori Kawano. "Use of Colored Reflectors for Negation or Highlighting of Scanned Color Information on Film-Based CIELAB-Coded Optical Logic Gate Models." Journal of Advanced Computational Intelligence and Intelligent Informatics 17, no. 6 (November 20, 2013): 799–804. http://dx.doi.org/10.20965/jaciii.2013.p0799.
Повний текст джерелаAkbari-Nodehi, Hanzaleh, and Mohammad Ali Maddah-Ali. "Secure Coded Multi-Party Computation for Massive Matrix Operations." IEEE Transactions on Information Theory 67, no. 4 (April 2021): 2379–98. http://dx.doi.org/10.1109/tit.2021.3050853.
Повний текст джерелаДисертації з теми "Coded Computation"
Wang, Sinong. "Coded Computation for Speeding up Distributed Machine Learning." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1555336880521062.
Повний текст джерелаChen, Yiqi. "Computation of Initial State for Tail-Biting Trellis." Ohio University / OhioLINK, 2005. http://www.ohiolink.edu/etd/view.cgi?ohiou1125026574.
Повний текст джерелаChan, Siu Yan. "Efficient computation of weight enumerators and performance bounds for convolutionally coded systems in quasi-static fading channels /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?ECED%202009%20CHANS.
Повний текст джерелаVeluri, Subrahmanya Pavan Kumar. "Code Verification and Numerical Accuracy Assessment for Finite Volume CFD Codes." Diss., Virginia Tech, 2010. http://hdl.handle.net/10919/28715.
Повний текст джерелаPh. D.
Ben, Hadj Fredj Abir. "Computations for the multiple access in wireless networks." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLT030.
Повний текст джерелаFuture generations of wireless networks pose many challenges for the research community. In particular, these networks must be able to respond, with a certain quality of service, to the demands of a large number of connected people and objects. This drives us into quite important requirements in terms of capacity. It is within this framework that non-orthogonal multiple access methods (NOMA) have been introduced. In this thesis, we have studied and proposed a multiple access method based on the compute and forward technique and on Lattice codes while considering different lattice constructions. We have also proposed improvements to the algorithm for decoding the Sparse code multiple access (SCMA) method based on Lattice codes. In order to simplify the multi-stage decoders used in here, we have proposed simplified expressions of LLRs as well as approximations. Finally, we studied the construction D of lattices using polar codes. This thesis was in collaboration with the research center of Huawei France
Zeng, Fanxuan. "Nonlinear codes: representation, constructions, minimum distance computation and decoding." Doctoral thesis, Universitat Autònoma de Barcelona, 2014. http://hdl.handle.net/10803/284241.
Повний текст джерелаRodal, Morten. "Scalability of seismic codes on computational clusters." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9145.
Повний текст джерелаCusdin, P. A. "Automatic sensitivity code for computational fluid dynamics." Thesis, Queen's University Belfast, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.431586.
Повний текст джерелаHagen, Knut Imar. "Fault-tolerance for MPI Codes on Computational Clusters." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-8728.
Повний текст джерелаThis thesis focuses on fault-tolerance for MPI codes on computational clusters. When an application runs on a very large cluster with thousands of processors, there is likely that a process crashes due to a hardware or software failure. Fault-tolerance is the ability of a system to respond gracefully to an unexpected hardware or software failure. A test application which is meant to run for several weeks on several nodes is used in this thesis. The application is a seismic MPI application, written in Fortran90. This application was provided by Statoil, who wanted a fault-tolerant implementation. The original test application had no degree of fault-tolerance --if one process or one node crashed, the entire application also crashed. In this thesis, a collection of fault-tolerant techniques are analysed, including checkpointing, MPI Error handlers, extending MPI, replication, fault detection, atomic clocks and multiple simultaneous failures. Several MPI implementations are described, like MPICH1, MPICH2, LAM/MPI and Open MPI. Next, some fault-tolerant products which are developed at other universities are described, like FT-MPI, FEMPI, MPICH-V including its five protocols, the fault-tolerant functionality of Open MPI, and MPI Error handlers. A fault-tolerant simulator which simulates the application's behaviour is developed. The simulator uses two fault-tolerance methods: FT-MPI and MPI Error handlers. Next, our test application is similarly made fault-tolerant with FT-MPI using three proposed approaches: MPI_Reduce(), MPI_Barrier(), and the final and current implementation: MPI Loop. Tests of the MPI Loop implementation are run on a small and a large cluster to verify the fault-tolerant behaviour. The seismic application survives a crash of n-2 nodes/processes. Process number 0 must stay alive since it acts as an I/O server, and there must be at least one process left to compute data. Processes can also be restarted rather than left out, but the test application needs to be modified to support this.
Bellini, Emanuele. "Computational techniques for nonlinear codes and Boolean functions." Doctoral thesis, Università degli studi di Trento, 2014. https://hdl.handle.net/11572/369066.
Повний текст джерелаКниги з теми "Coded Computation"
Fujii, Keisuke. Quantum Computation with Topological Codes. Singapore: Springer Singapore, 2015. http://dx.doi.org/10.1007/978-981-287-996-7.
Повний текст джерелаAlbuquerque, Clarice Dias de, Eduardo Brandani da Silva, and Waldir Silva Soares. Quantum Codes for Topological Quantum Computation. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-06833-1.
Повний текст джерелаBlock error-correcting codes: A computational primer. Berlin: Springer, 2003.
Знайти повний текст джерелаParthasarathy, K. R. Lectures on quantum computation, quantum error: Correcting codes and information theory. New Delhi: Published for the Tata Institute of Fundamental Research [by] Narosa Pub. House, 2006.
Знайти повний текст джерелаMatters computational: Ideas, algorithms, source code. Heidelberg: Springer, 2011.
Знайти повний текст джерелаWigton, L. B. GMRES acceleration of computational fluid dynamics codes. New York: AIAA, 1985.
Знайти повний текст джерелаXambØ-Descamps, S. Block error-correcting codes: A computational primer. Berlin: Springer, 2002.
Знайти повний текст джерелаJustesen, Jorn. A course in error-correcting codes. Zurich: European Mathematical Society, 2004.
Знайти повний текст джерелаLin, Shu. Trellises and trellis-based decoding algorithms for linear block codes. [Washington, DC: National Aeronautics and Space Administration, 1998.
Знайти повний текст джерелаLin, Shu. Trellises and trellis-based decoding algorithms for linear block codes. [Washington, DC: National Aeronautics and Space Administration, 1998.
Знайти повний текст джерелаЧастини книг з теми "Coded Computation"
Barendregt, Henk. "Discriminating Coded Lambda Terms." In Logic, Meaning and Computation, 275–85. Dordrecht: Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-010-0526-5_12.
Повний текст джерелаKorejo, Imtiaz, Shengxiang Yang, and Changhe Li. "A Directed Mutation Operator for Real Coded Genetic Algorithms." In Applications of Evolutionary Computation, 491–500. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12239-2_51.
Повний текст джерелаDrake, Stephen. "Uniform Crossover Revisited: Maximum Disruption in Real-Coded GAs." In Genetic and Evolutionary Computation — GECCO 2003, 1576–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45110-2_32.
Повний текст джерелаDatta, Dilip, and José Rui Figueira. "A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study." In Evolutionary Computation in Combinatorial Optimization, 35–46. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12139-5_4.
Повний текст джерелаTezuka, Masaru, Masaharu Munetomo, and Kiyoshi Akama. "Linkage Identification by Nonlinearity Check for Real-Coded Genetic Algorithms." In Genetic and Evolutionary Computation – GECCO 2004, 222–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24855-2_20.
Повний текст джерелаBazargani, Mosab, Luís Mateus, and Maria Amélia R. Loja. "Planar Surfaces Recognition in 3D Point Cloud Using a Real-Coded Multistage Genetic Algorithm." In Applications of Evolutionary Computation, 529–40. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-16549-3_43.
Повний текст джерелаGiacobini, Mario, Mike Preuss, and Marco Tomassini. "Effects of Scale-Free and Small-World Topologies on Binary Coded Self-adaptive CEA." In Evolutionary Computation in Combinatorial Optimization, 86–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11730095_8.
Повний текст джерелаPark, Sung-Joon, and Masayuki Yamamura. "Real-Coded Genetic Algorithm to Reveal Biological Significant Sites of Remotely Homologous Proteins." In Genetic and Evolutionary Computation — GECCO 2003, 1602–3. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45110-2_45.
Повний текст джерелаAhn, Chang Wook, R. S. Ramakrishna, and David E. Goldberg. "Real-Coded Bayesian Optimization Algorithm: Bringing the Strength of BOA into the Continuous World." In Genetic and Evolutionary Computation – GECCO 2004, 840–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24854-5_86.
Повний текст джерелаHausmann, Daniel, and Lutz Schröder. "Quasipolynomial Computation of Nested Fixpoints." In Tools and Algorithms for the Construction and Analysis of Systems, 38–56. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_3.
Повний текст джерелаТези доповідей конференцій з теми "Coded Computation"
Yosibash, Royee, and Ram Zamir. "Frame Codes For Distributed Coded Computation." In 2021 11th International Symposium on Topics in Coding (ISTC). IEEE, 2021. http://dx.doi.org/10.1109/istc49272.2021.9594259.
Повний текст джерелаFerdinand, Nuwan, and Stark C. Draper. "Hierarchical Coded Computation." In 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, 2018. http://dx.doi.org/10.1109/isit.2018.8437473.
Повний текст джерелаKim, Minchul, and Jungwoo Lee. "Private Secure Coded Computation." In 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849252.
Повний текст джерелаDas, Anindya B., Li Tang, and Aditya Ramamoorthy. "C3LES: Codes for Coded Computation that Leverage Stragglers." In 2018 IEEE Information Theory Workshop (ITW). IEEE, 2018. http://dx.doi.org/10.1109/itw.2018.8613321.
Повний текст джерелаRachlin, Eric, and John E. Savage. "A framework for coded computation." In 2008 IEEE International Symposium on Information Theory - ISIT. IEEE, 2008. http://dx.doi.org/10.1109/isit.2008.4595409.
Повний текст джерелаReisizadeh, Amirhossein, Saurav Prakash, Ramtin Pedarsani, and Salman Avestimehr. "Coded computation over heterogeneous clusters." In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8006961.
Повний текст джерелаLee, Kangwook, Ramtin Pedarsani, Dimitris Papailiopoulos, and Kannan Ramchandran. "Coded computation for multicore setups." In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8006962.
Повний текст джерелаKim, Wilton, Stanislav Kruglik, and Han Mao Kiah. "Coded Computation of Multiple Functions." In 2023 IEEE Information Theory Workshop (ITW). IEEE, 2023. http://dx.doi.org/10.1109/itw55543.2023.10161651.
Повний текст джерелаKiani, Shahrzad, Nuwan Ferdinand, and Stark C. Draper. "Exploitation of Stragglers in Coded Computation." In 2018 IEEE International Symposium on Information Theory (ISIT). IEEE, 2018. http://dx.doi.org/10.1109/isit.2018.8437871.
Повний текст джерелаSun, Yuxuan, Junlin Zhao, Sheng Zhou, and Deniz Gunduz. "Heterogeneous Coded Computation across Heterogeneous Workers." In GLOBECOM 2019 - 2019 IEEE Global Communications Conference. IEEE, 2019. http://dx.doi.org/10.1109/globecom38437.2019.9014006.
Повний текст джерелаЗвіти організацій з теми "Coded Computation"
Gleich, David, and Ananth Grama. Current possibilities and future opportunities for erasure coded computations. Office of Scientific and Technical Information (OSTI), December 2020. http://dx.doi.org/10.2172/1734624.
Повний текст джерелаGrebennikov, A. N., A. K. Zhitnik, and O. A. Zvenigorodskaya. Results of comparative RBMK neutron computation using VNIIEF codes (cell computation, 3D statics, 3D kinetics). Final report. Office of Scientific and Technical Information (OSTI), December 1995. http://dx.doi.org/10.2172/219464.
Повний текст джерелаBatra, Romesh C. Computations for Truck Sliding with TRUCK 3.1 Code. Fort Belvoir, VA: Defense Technical Information Center, August 1989. http://dx.doi.org/10.21236/ada212270.
Повний текст джерелаAeschliman, D. P., and W. L. Oberkampf. Experimental methodology for computational fluid dynamics code validation. Office of Scientific and Technical Information (OSTI), September 1997. http://dx.doi.org/10.2172/563720.
Повний текст джерелаHaehnel, Robert, Yonghu Wenren, and Luke Allen. SAGE-PEDD theory manual : modeling windblown snow deposition around buildings. Engineer Research and Development Center (U.S.), August 2022. http://dx.doi.org/10.21079/11681/44942.
Повний текст джерелаVan Buren, Kendra L., Jesse M. Canfield, Francois M. Hemez, and Jeremy A. Sauer. Code Verification of the HIGRAD Computational Fluid Dynamics Solver. Office of Scientific and Technical Information (OSTI), May 2012. http://dx.doi.org/10.2172/1040022.
Повний текст джерелаOberkampf, W. L., and F. G. Blottner. Issues in computational fluid dynamics code verification and validation. Office of Scientific and Technical Information (OSTI), September 1997. http://dx.doi.org/10.2172/544047.
Повний текст джерелаDeGiorgi, Virginia G., and Stephanie A. Wimmer. Evaluation of Computational Codes for Underwater Hull Analysis Model Applications. Fort Belvoir, VA: Defense Technical Information Center, February 2014. http://dx.doi.org/10.21236/ada594756.
Повний текст джерелаChriston, M. A. HYDRA, A finite element computational fluid dynamics code: User manual. Office of Scientific and Technical Information (OSTI), June 1995. http://dx.doi.org/10.2172/109508.
Повний текст джерелаNichols, B. D., C. Mueller, G. A. Necker, J. R. Travis, J. W. Spore, K. L. Lam, P. Royl, R. Redlinger, and T. L. Wilson. GASFLOW: A Computational Fluid Dynamics Code for Gases, Aerosols, and Combustion, Volume 1: Theory and Computational Model. Office of Scientific and Technical Information (OSTI), October 1998. http://dx.doi.org/10.2172/1218.
Повний текст джерела