Academic literature on the topic 'REDD+ Scheme'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'REDD+ Scheme.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "REDD+ Scheme"
Hjort, Mattias. "Who should be governed to reduce deforestation and how? Multiple governmentalities at the REDD+ negotiations." Environment and Planning C: Politics and Space 38, no. 1 (April 5, 2019): 134–52. http://dx.doi.org/10.1177/2399654419837298.
Full textHook, Andrew. "Following REDD+: Elite agendas, political temporalities, and the politics of environmental policy failure in Guyana." Environment and Planning E: Nature and Space 3, no. 4 (September 20, 2019): 999–1029. http://dx.doi.org/10.1177/2514848619875665.
Full textSheng, Jichuan. "Effect of Uncertainties in Estimated Carbon Reduction from Deforestation and Forest Degradation on Required Incentive Payments in Developing Countries." Sustainability 9, no. 9 (September 9, 2017): 1608. http://dx.doi.org/10.3390/su9091608.
Full textGoodman, James, and Ellen Roberts. "Is the United Nations' REDD scheme conservation colonialism by default?" International Journal of Water 5, no. 4 (2010): 419. http://dx.doi.org/10.1504/ijw.2010.038733.
Full textMusthafa, I. Z. F., and Youn Y-C. "Motivation and factors affecting Indigenous People's willingness to participate in future REDD+ project activities: the case of Tagal Hutan in Sabah, Malaysia." International Forestry Review 24, no. 3 (September 1, 2022): 411–25. http://dx.doi.org/10.1505/146554822835941904.
Full textAsiyanbi, Adeniyi, and Kate Massarella. "Transformation is what you expect, models are what you get: REDD+ and models in conservation and development." Journal of Political Ecology 27, no. 1 (May 6, 2020): preprint. http://dx.doi.org/10.2458/v27i1.23540.
Full textSheng, Jichuan, You Wu, Mingyang Zhang, and Zhuang Miao. "An evolutionary modeling approach for designing a contractual REDD+ payment scheme." Ecological Indicators 79 (August 2017): 276–85. http://dx.doi.org/10.1016/j.ecolind.2017.04.010.
Full textFiguières, Charles. "The REDD Scheme to Curb Deforestation: A Well-designed System of Incentives?" Strategic Behavior and the Environment 2, no. 3 (September 17, 2012): 239–57. http://dx.doi.org/10.1561/102.00000017.
Full textSusanti, Delvia, and Adiasri Purbantina. "Diplomasi Lingkungan Norwegia kepada Indonesia: Analisis Skema REDD+ tahun 2015-2020." PROCEEDING INTERNATIONAL RELATIONS ON INDONESIAN FOREIGN POLICY CONFERENCE 1, no. 1 (December 2, 2021): 73–88. http://dx.doi.org/10.33005/irofonic.v1i1.14.
Full textApriwan and S. Anita Afriani. "Local Readiness Towards REDD+ UNFCCC Scheme (Study in Province of West Sumatera Indonesia)." Procedia Environmental Sciences 28 (2015): 649–56. http://dx.doi.org/10.1016/j.proenv.2015.07.076.
Full textDissertations / Theses on the topic "REDD+ Scheme"
Jaimes, Luz Marina Santos. "A privacy-preserving reputation scheme for trust management on VANETs applications." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-14112017-084229/.
Full textOs veículos usarão pseudônimos em vez de certificados de longo prazo para fornecer segurança e privacidade. Os pseudônimos são certificados de chaves públicas de curto prazo que não contêm informação da identidade do veículo. No entanto, existe risco que veículos autorizados possam enviar mensagens falsas ou se comportar de maneira egoísta, e isso pode afetar o desempenho das redes veiculares (VANETs). Nesse contexto, o gerenciamento de confiança é um importante serviço de segurança nas VANETs, o qual fornece um sistema unificado para estabelecer relações entre os nós e ajuda a manter um registro do comportamento dos veículos. No entanto, é uma tarefa desafiante monitorar o padrão evolutivo do comportamento veicular, já que a comunicação entre os veículos é anônima. Não é uma tarefa fácil encontrar uma solução equilibrada que atenda aos requisitos de segurança, privacidade e gerenciamento de confiança em VANET. Em vista disso, apresentamos um Esquema de Reputação Preservando a Privacidade (ERPP) aplicado a VANETs, no qual um servidor de reputação através de uma unidade de acostamento recebe avaliações sobre o comportamento dos veículos. O servidor atualiza e certifica a reputação dos veículos relacionando seus identidades anônimas com as reais. ERPP introduz áreas geográficas de segurança, na qual a segurança de uma área pode ser adaptada a níveis mais elevados ou mais baixos dependendo da reputação dos veículos. Além, uma reputação complexa é examinada, na qual a reputação de um veículo está vinculada a vários fatores do comportamento. Uma outra área que é explorada é a avaliação de desempenho do ERPP o qual é conduzida através de simulações em um cenário urbano, com base na aplicação de encaminhamento oportunista de mensagens. Os resultados mostraram a eficácia do ERPP em termos de avaliar o comportamento dos veículos e tomar medidas contra os veículos mal comportados. Utilizamos SUMO para simular o modelo de mobilidade; OMNET++ e Veins suportaram o modelo de red; and Crypto++ foi usado para implementar as funções criptográficas de curvas elípticas de assinatura e verificação de mensagens como recomendam os padrões de segurança. Finalmente, empregamos uma estratégia de mudança de pseudônimo na qual a reputação é discretizada em dois níveis de reputação. A estratégia foi implementada em um cenário de simulação de tráfego realista e foi comparada com as estratégias nomeadas de estado e síncrona mediante simulações. Os resultados mostraram que o número de pseudônimos utilizados em nossa estratégia é menor que os esquemas mencionados, e mantém a taxa de sucesso de mudança de pseudônimo alcançada pela estratégia síncrona.
Soverini, Davide. "Development of testing procedures for the πLUP read-out board." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/17044/.
Full textYazigy, Amal Jamil. "Schema theory and learning to read in a second language." Thesis, University of Leicester, 1992. http://hdl.handle.net/2381/35691.
Full textTomic, Taeda. "Commentary on Chris Reed and Doug Walton : "Argumentation Schemes in Dialogue"." Uppsala universitet, Filosofiska institutionen, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-150974.
Full textEsfahani, Alireza. "Security schemes against pollution attacks in network coding over wireless networks." Doctoral thesis, Universidade de Aveiro, 2017. http://hdl.handle.net/10773/21773.
Full textResumo em português não disponivel
The topic of this thesis is how to achieve e cient security against pollution attacks by exploiting the structure of network coding. There has recently been growing interest in using network coding techniques to increase the robustness and throughput of data networks, and reduce the delay in wireless networks, where a network coding-based scheme takes advantage of the additive nature of wireless signals by allowing two nodes to transmit simultaneously to the relay node. However, Network Coding (NC)-enabled wireless networks are susceptible to a severe security threat, known as data pollution attack, where a malicious node injects into the network polluted (i.e., corrupted) packets that prevent the destination nodes from decoding correctly. Due to recoding at the intermediate nodes, according to the core principle of NC, the polluted packets propagate quickly into other packets and corrupt bunches of legitimate packets leading to network resource waste. Hence, a lot of research e ort has been devoted to schemes against data pollution attacks. Homomorphic Message Authentication Code (MAC)-based schemes are a promising solution against data pollution attacks. However, most of them are susceptible to a new type of pollution attack, called tag pollution attack, where an adversary node randomly modi es tags appended to the end of the transmitted packets. Therefore, in this thesis, we rst propose a homomorphic message authentication code-based scheme, providing resistance against data pollution attacks and tag pollution attacks in XOR NC-enabled wireless networks. Moreover, we propose four homomorphic message authentication code-based schemes which provide resistance against data and tag pollution attacks in Random Linear Network Coding (RLNC). Our results show that our proposed schemes are more e cient compared to other competitive tag pollution immune schemes in terms of complexity, communication overhead and key storage overhead.
Valvo, Daniel William. "Repairing Cartesian Codes with Linear Exact Repair Schemes." Thesis, Virginia Tech, 2020. http://hdl.handle.net/10919/98818.
Full textMaster of Science
Distributed storage systems are systems which store a single data file over multiple storage nodes. Each storage node has a certain storage efficiency, the "space" required to store the information on that node. The value of these systems, is their ability to safely store data for extended periods of time. We want to design distributed storage systems such that if one storage node fails, we can recover it from the data in the remaining nodes. Recovering a node from the data stored in the other nodes requires the nodes to communicate data with each other. Ideally, these systems are designed to minimize the bandwidth, the inter-nodal communication required to recover a lost node, as well as maximize the storage efficiency of each node. A great mathematical framework to build these distributed storage systems on is erasure codes. In this paper, we will specifically develop distributed storage systems that use Cartesian codes. We will show that in the right setting, these systems can have a very similar bandwidth to systems build from Reed-Solomon codes, without much loss in storage efficiency.
Susanto, Misfa. "Network Coding for Multihop Wireless Networks: Joint Random Linear Network Coding and Forward Error Correction with Interleaving for Multihop Wireless Networks." Thesis, University of Bradford, 2015. http://hdl.handle.net/10454/14864.
Full textRodrigues, Diego de Azevedo, and 981997982. "A Study on Machine Learning Techniques for the Schema Matching Networks Problem." Universidade Federal do Amazonas, 2018. https://tede.ufam.edu.br/handle/tede/6801.
Full textApproved for entry into archive by Secretaria PPGI (secretariappgi@icomp.ufam.edu.br) on 2018-12-07T22:27:06Z (GMT) No. of bitstreams: 2 Diego Rodrigues.pdf: 3673641 bytes, checksum: f1fdd4162dc6acd590136bb6b886704e (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2018-12-10T19:02:56Z (GMT) No. of bitstreams: 2 Diego Rodrigues.pdf: 3673641 bytes, checksum: f1fdd4162dc6acd590136bb6b886704e (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2018-12-10T19:02:56Z (GMT). No. of bitstreams: 2 Diego Rodrigues.pdf: 3673641 bytes, checksum: f1fdd4162dc6acd590136bb6b886704e (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2018-10-22
CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Schema Matching is the problem of finding semantic correspondences between elements from different schemas. This is a challenging problem, since the same concept is often represented by disparate elements in the schemas. The traditional instances of this problem involved a pair of schemas to be matched. However, recently there has been a increasing interest in matching several related schemas at once, a problem known as Schema Matching Networks, where the goal is to identify elements from several schemas that correspond to a single concept. We propose a family of methods for schema matching networks based on machine learning, which proved to be a competitive alternative for the traditional matching problem in several domains. To overcome the issue of requiring a large amount of training data, we also propose a bootstrapping procedure to automatically generate training data. In addition, we leverage constraints that arise in network scenarios to improve the quality of this data. We also propose a strategy for receiving user feedback to assert some of the matchings generated, and, relying on this feedback, improving the quality of the final result. Our experiments show that our methods can outperform baselines reaching F1-score up to 0.83.
Casamento de Esquemas é a tarefa de encontrar correpondências entre elementos de diferentes esquemas de bancos de dados. É um problema desafiador, uma vez que o mesmo conceito geralmente é representado de maneiras distintas nos esquemas.Tradicionalmente, a tarefa envolve um par de esquemas a serem mapeados. Entretanto, houve um crescimento na necessidade de mapear vários esquemas ao mesmo tempo, tarefa conhecida como Casamento de Esquemas em Rede, onde o objetivo é identificar elementos de vários esquemas que correspondem ao mesmo conceito. Este trabalho propõe uma famı́lia de métodos para o problema do casamento de esquemas em rede baseados em aprendizagem de máquina, que provou ser uma alternativa viável para o problema do casamento tradicional em diversos domı́nios. Para superar obstáculo de obter bastantes instâncias de treino, também é proposta uma técnica de bootstrapping para gerar treino automático. Além disso, o trabalho considera restrições de integridade que ajudam a nortear o processo de casamento em rede. Este trabalho também propõe uma estratégia para receber avaliações do usuário, com o propósito de melhorar o resultado final. Experimentos mostram que o método proposto supera outros métodos comparados alcançando valor F1 até 0.83 e sem utilizar muitas avaliações do usuário.
TAKEDA, Marcos Yuichi. "A Comparison between RS+TCM and LDPC FEC schemes for the G.fast standard." Universidade Federal do Pará, 2016. http://repositorio.ufpa.br/jspui/handle/2011/8036.
Full textApproved for entry into archive by Edisangela Bastos (edisangela@ufpa.br) on 2017-03-28T14:47:19Z (GMT) No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Dissertacao_ComparacaoRS+TCMLDPC.pdf: 893867 bytes, checksum: 0e75a129249af6c11b8245bcb9bf9e5b (MD5)
Made available in DSpace on 2017-03-28T14:47:19Z (GMT). No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Dissertacao_ComparacaoRS+TCMLDPC.pdf: 893867 bytes, checksum: 0e75a129249af6c11b8245bcb9bf9e5b (MD5) Previous issue date: 2016-02-01
CNPq - Conselho Nacional de Desenvolvimento Científico e Tecnológico
A necessidade de velocidades de conexão a internet cada vez maiores motivou a criação de um novo padrão, G.fast, para DSL (linha digital do assinante), de modo a prover performance semelhante a fibra usando par trançado de fios de cobre. Esta dissertação foca em dois prévios candidatos a esquemas de correção de erro, sendo eles codigos Reed-Solomon com modulaçao codificada em treliça (TCM), de padrões DSL anteriores, e códigos de verificação de paridade de baixa densidade (LDPC), do padrão G.hn para redes residenciais. O objetivo principal é comparar os dois esquemas, de modo a avaliar qual deles tem melhor performance, considerando métricas como poder de correção de erro e custo computacional. Embora o código selecionado para o G.fast já tenha sido RS+TCM, acredita-se que esta decisão foi tendenciosa, já que é sabido que códigos mais recentes como LDPC possuem maior poder correção.
The need for increasing internet connection speeds motivated the creation of a new standard, G.fast, for digital subscriber lines (DSL), in order to provide fiber-like performance using short twisted pair copper wires. This dissertation focuses in the two former candidate codes for the forward error correction (FEC) scheme, namely Reed-Solomon (RS) with trellis-coded modulation (TCM), from previous DSL standards, and low density parity check (LDPC) codes, from the G.hn standard for home networking. The main objective is to compare both schemes, in order to evaluate which of them performs better, considering metrics such as error correction performance and computational cost. Even though the selected code for G.fast was RS with TCM, it is believed that this choice was biased, as a more recent iterative code like LDPC is known to have a better error correction performance.
Vucht, Tijssen Bertje Elisabeth van. "Uit de ban van de rede : een confrontatie tussen de cultuur- en kennissociologische visies van Max Scheler en Max Weber /." Utrecht : Instituut voor culturele antropologie, 1985. http://catalogue.bnf.fr/ark:/12148/cb35488160g.
Full textMention parallèle de titre ou de responsabilité : Lösung aus dem Bann der Vernunft : eine Konfrontation zwischen der kultur- und wissenssoziologischen Auffassung von Max Scheler und Max Weber. Résumé en allemand. Bibliogr. p. 376-394. Index.
Books on the topic "REDD+ Scheme"
Great Britain. Scottish Office. Pensions Agency. Scottish Teachers' Superannuation Scheme: An easy-to-read guide. Edinburgh: SOPA, 1993.
Find full textWaddington, Eileen. Going home: An evaluation of British Red Cross home from hospital schemes. London: British Red Cross, 1996.
Find full textMcLean, Catherine. An evaluative study of the Red Cross Hospital Aftercare Service - Omagh: A voluntary sector pilot scheme which aims to support older people, aged over 65 years, as part of post-discharge multi-sector care provision following temporary admission to hospital. (s.l: The Author), 2004.
Find full textCritical media is elementary: Teaching youth to critically read and create media. New York: Peter Lang, 2008.
Find full textKlaassen, C. J. M. Schadeveroorzakend handelen in functie-- diverse wegen leiden naar de werkgever: Enkele beschouwingen over de aansprakelijkheid van de werkgever en de ondergeschikte voor schade toegebracht of opgelopen in het kader van het werk : rede ... Deventer: W.E.J. Tjeenk Willink, 2000.
Find full textMacmillan: Read Scheme Teachers Guide Rev. Macmillan Education Ltd, 1987.
Find full textStaff, Ladybird Books. Read with Me: Key Words Reading Scheme. Penguin Books, Limited, 2006.
Find full textMurray, W., and Jill Corby. Magic Music (Read with Me: Key Words Reading Scheme). Ladybird Books Ltd, 1999.
Find full textPicture Dictionary (Read with Me: Key Words Reading Scheme). Ladybird Books Ltd, 1999.
Find full textMurray, W., and Jill Corby. Let's Play (Read with Me: Key Words Reading Scheme). Ladybird Books Ltd, 1993.
Find full textBook chapters on the topic "REDD+ Scheme"
Woleński, Jan. "Read about T-Scheme." In Unity, Truth and the Liar, 199–203. Dordrecht: Springer Netherlands, 2008. http://dx.doi.org/10.1007/978-1-4020-8468-3_12.
Full textFontaine, Caroline, and Fabien Galand. "How Can Reed-Solomon Codes Improve Steganographic Schemes?" In Information Hiding, 130–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-77370-2_9.
Full textKoo, Jahwan, Vladimir V. Shakhov, and Hyunseung Choo. "An Enhanced RED-Based Scheme for Differentiated Loss Guarantees." In Management of Convergence Networks and Services, 481–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11876601_49.
Full textChalla, RatnaKumari, and VijayaKumari Gunta. "Reed-Muller Code Based Symmetric Key Fully Homomorphic Encryption Scheme." In Information Systems Security, 499–508. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49806-5_29.
Full textSarkar, Pinaki, and Morshed U. Chowdhury. "Key Predistribution Scheme Using Finite Fields and Reed Muller Codes." In Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2011, 67–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22288-7_6.
Full textMumford, David B. "References: The Red Book of Varieties and Schemes." In Lecture Notes in Mathematics, 293. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-540-46021-3_5.
Full textDybdahl, Haakon, Marius Grannæs, and Lasse Natvig. "Cache Write-Back Schemes for Embedded Destructive-Read DRAM." In Architecture of Computing Systems - ARCS 2006, 145–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11682127_11.
Full textXiaoqin, Guan, and Guan Xiaotao. "Efficient Training Scheme to Improve the Ability of Draw and Read Graphics." In Information and Business Intelligence, 312–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29087-9_48.
Full textWang, Yong, Hao Xie, and Ruyi Wang. "Digital Signature Scheme to Match Generalized Reed-Solomon Code over GF(q)." In Cyberspace Safety and Security, 32–47. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-18067-5_3.
Full textArora, Sanjeev, and Kevin L. Chang. "Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem." In Automata, Languages and Programming, 176–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45061-0_16.
Full textConference papers on the topic "REDD+ Scheme"
A. Akintola, A., G. A. Aderounmu, L. A. Akanbi, and M. O. Adigun. "Modeling and Performance Analysis of Dynamic Random Early Detection (DRED) Gateway for Congestion Avoidance." In InSITE 2005: Informing Science + IT Education Conference. Informing Science Institute, 2005. http://dx.doi.org/10.28945/2920.
Full textKim, Yong W., Leonel Arellano, Mark Vardakas, Hee-Koo Moon, and Kenneth O. Smith. "Comparison of Trip-Strip/Impingement/Dimple Cooling Concepts at High Reynolds Numbers." In ASME Turbo Expo 2003, collocated with the 2003 International Joint Power Generation Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/gt2003-38935.
Full textPe´rez Arancibia, Ne´stor O., Chi-Ying Lin, Tsu-Chin Tsao, and James S. Gibson. "Adaptive and Repetitive Control for Rejecting Repeatable and Non-Repeatable Runout in Rotating Devices." In ASME 2007 International Mechanical Engineering Congress and Exposition. ASMEDC, 2007. http://dx.doi.org/10.1115/imece2007-43534.
Full textChauhan, Sonam, and Ajay Sharma. "Fuzzy Commitment Scheme based on Reed Solomon Codes." In SIN '16: 9th International Conference on Security of Information and Networks. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2947626.2947649.
Full textWang, Hao, Wei Zhang, and Yanyan Liu. "Joint Coding Scheme Based on Reed-Solomon Codes." In 2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS). IEEE, 2021. http://dx.doi.org/10.1109/icccs52626.2021.9449143.
Full textSaraswatula, Sree Rama KC, Santosh Yachareni, Shidong Zhou, Narendra Pulipati, Joy Chen, and Teja Masina. "Robust Adaptive Read Scheme for 7nm Configuration SRAMs." In 2021 IEEE 27th International Symposium on On-Line Testing and Robust System Design (IOLTS). IEEE, 2021. http://dx.doi.org/10.1109/iolts52814.2021.9486712.
Full textVoyiatzis, I., C. Sgouropoulou, and C. Efstathiou. "A concurrent BIST scheme for read only memories." In 2015 10th International Conference on Design & Technology of Integrated Systems in Nanoscale Era (DTIS). IEEE, 2015. http://dx.doi.org/10.1109/dtis.2015.7127366.
Full textAfanasyeva, Alexandra, Sergey Bezzateev, Evgeny Linsky, Vitaly Petrov, and DaeYoub Kim. "Threshold identity based encryption scheme on quadratic residues." In 2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems (RED). IEEE, 2012. http://dx.doi.org/10.1109/red.2012.6338393.
Full textGilmutdinov, Marat, Nickolay Egorov, and Dmitriy Novikov. "Lossless image compression scheme with binary layers scanning." In 2014 XIV International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY). IEEE, 2014. http://dx.doi.org/10.1109/red.2014.7016703.
Full textLu, Mengting, Fang Wang, Dan Feng, and Yuchong Hu. "A Read-leveling Data Distribution Scheme for Promoting Read Performance in SSDs with Deduplication." In ICPP 2019: 48th International Conference on Parallel Processing. New York, NY, USA: ACM, 2019. http://dx.doi.org/10.1145/3337821.3337884.
Full textReports on the topic "REDD+ Scheme"
Lacan, J., V. Roca, J. Peltotalo, and S. Peltotalo. Reed-Solomon Forward Error Correction (FEC) Schemes. RFC Editor, April 2009. http://dx.doi.org/10.17487/rfc5510.
Full textRoca, V., M. Cunche, J. Lacan, A. Bouabdallah, and K. Matsuzono. Simple Reed-Solomon Forward Error Correction (FEC) Scheme for FECFRAME. RFC Editor, February 2013. http://dx.doi.org/10.17487/rfc6865.
Full textMarcos Morezuelas, Paloma. Gender, Forests and Climate Change. Inter-American Development Bank, March 2021. http://dx.doi.org/10.18235/0003072.
Full textBenson, Vivienne, and Jenny C. Aker. Improving Adult Literacy in Niger Through Mobile Calls to Teachers. Institute of Development Studies and The Impact Initiative, February 2021. http://dx.doi.org/10.35648/20.500.12413/11781/ii368.
Full text