1 resultado para Cyanobacterial bloom
em Boston University Digital Common
Filtro por publicador
- Aberystwyth University Repository - Reino Unido (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- Aquatic Commons (47)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (6)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (2)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (5)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (1)
- Boston University Digital Common (1)
- Brock University, Canada (5)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- Cambridge University Engineering Department Publications Database (1)
- CentAUR: Central Archive University of Reading - UK (16)
- Center for Jewish History Digital Collections (2)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (165)
- Cochin University of Science & Technology (CUSAT), India (12)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- Deakin Research Online - Australia (36)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Archives@Colby (1)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (4)
- Digital Repository at Iowa State University (1)
- DigitalCommons - The University of Maine Research (3)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (7)
- Helda - Digital Repository of University of Helsinki (17)
- Indian Institute of Science - Bangalore - Índia (2)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Nacional de Saúde de Portugal (2)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (3)
- Memoria Académica - FaHCE, UNLP - Argentina (3)
- Ministerio de Cultura, Spain (40)
- National Center for Biotechnology Information - NCBI (6)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (144)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- Publishing Network for Geoscientific & Environmental Data (30)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (48)
- Queensland University of Technology - ePrints Archive (37)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositorio Académico de la Universidad Nacional de Costa Rica (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (3)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositório Institucional da Universidade Federal do Rio Grande do Norte (1)
- Repositorio Institucional de la Universidad de El Salvador (28)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (181)
- SAPIENTIA - Universidade do Algarve - Portugal (6)
- Universidad de Alicante (2)
- Universidad del Rosario, Colombia (13)
- Universidad Politécnica de Madrid (1)
- Universidade dos Açores - Portugal (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (11)
- Universidade Técnica de Lisboa (1)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (2)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (12)
- University of Michigan (7)
- University of Queensland eSpace - Australia (30)
- University of Southampton, United Kingdom (1)
- University of Washington (2)
- WestminsterResearch - UK (3)
Resumo:
We present new, simple, efficient data structures for approximate reconciliation of set differences, a useful standalone primitive for peer-to-peer networks and a natural subroutine in methods for exact reconciliation. In the approximate reconciliation problem, peers A and B respectively have subsets of elements SA and SB of a large universe U. Peer A wishes to send a short message M to peer B with the goal that B should use M to determine as many elements in the set SB–SA as possible. To avoid the expense of round trip communication times, we focus on the situation where a single message M is sent. We motivate the performance tradeoffs between message size, accuracy and computation time for this problem with a straightforward approach using Bloom filters. We then introduce approximation reconciliation trees, a more computationally efficient solution that combines techniques from Patricia tries, Merkle trees, and Bloom filters. We present an analysis of approximation reconciliation trees and provide experimental results comparing the various methods proposed for approximate reconciliation.