1 resultado para UPPER CAVE
em Massachusetts Institute of Technology
Filtro por publicador
- Aberystwyth University Repository - Reino Unido (2)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (9)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (7)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (5)
- Aquatic Commons (32)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (4)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (3)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (46)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (17)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (126)
- Boston University Digital Common (2)
- Brock University, Canada (66)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- CaltechTHESIS (5)
- Cambridge University Engineering Department Publications Database (15)
- CentAUR: Central Archive University of Reading - UK (67)
- Center for Jewish History Digital Collections (2)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (50)
- Cochin University of Science & Technology (CUSAT), India (5)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Dalarna University College Electronic Archive (17)
- Deakin Research Online - Australia (49)
- Department of Computer Science E-Repository - King's College London, Strand, London (1)
- Digital Commons - Michigan Tech (12)
- Digital Commons - Montana Tech (5)
- Digital Peer Publishing (3)
- DigitalCommons@The Texas Medical Center (2)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Duke University (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (3)
- Gallica, Bibliotheque Numerique - Bibliothèque nationale de France (French National Library) (BnF), France (2)
- Greenwich Academic Literature Archive - UK (2)
- Helda - Digital Repository of University of Helsinki (14)
- Indian Institute of Science - Bangalore - Índia (28)
- Instituto Politécnico do Porto, Portugal (3)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (1)
- Ministerio de Cultura, Spain (4)
- National Center for Biotechnology Information - NCBI (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (12)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- Publishing Network for Geoscientific & Environmental Data (46)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (92)
- Queensland University of Technology - ePrints Archive (57)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório do Centro Hospitalar de Lisboa Central, EPE - Centro Hospitalar de Lisboa Central, EPE, Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (151)
- SAPIENTIA - Universidade do Algarve - Portugal (3)
- School of Medicine, Washington University, United States (2)
- Universidad Autónoma de Nuevo León, Mexico (1)
- Universidad del Rosario, Colombia (1)
- Universidade Federal do Pará (1)
- Universitat de Girona, Spain (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (2)
- Université de Lausanne, Switzerland (2)
- Université de Montréal, Canada (3)
- University of Connecticut - USA (1)
Relevância:
Resumo:
We present techniques for computing upper and lower bounds on the likelihoods of partial instantiations of variables in sigmoid and noisy-OR networks. The bounds determine confidence intervals for the desired likelihoods and become useful when the size of the network (or clique size) precludes exact computations. We illustrate the tightness of the obtained bounds by numerical experiments.