1 resultado para TV white spaces
em Massachusetts Institute of Technology
Filtro por publicador
- JISC Information Environment Repository (1)
- Aberystwyth University Repository - Reino Unido (4)
- Adam Mickiewicz University Repository (3)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (2)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (59)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (12)
- Biblioteca Digital da Câmara dos Deputados (7)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (9)
- Boston University Digital Common (1)
- Brock University, Canada (17)
- CaltechTHESIS (6)
- Cambridge University Engineering Department Publications Database (41)
- CentAUR: Central Archive University of Reading - UK (6)
- Center for Jewish History Digital Collections (2)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (112)
- Cochin University of Science & Technology (CUSAT), India (23)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- CUNY Academic Works (4)
- Dalarna University College Electronic Archive (1)
- Deakin Research Online - Australia (5)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (4)
- Digital Commons - Michigan Tech (1)
- Duke University (8)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (16)
- FAUBA DIGITAL: Repositorio institucional científico y académico de la Facultad de Agronomia de la Universidad de Buenos Aires (1)
- Gallica, Bibliotheque Numerique - Bibliothèque nationale de France (French National Library) (BnF), France (6)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (4)
- Helda - Digital Repository of University of Helsinki (30)
- Indian Institute of Science - Bangalore - Índia (62)
- Infoteca EMBRAPA (1)
- Instituto Politécnico de Castelo Branco - Portugal (2)
- Instituto Politécnico do Porto, Portugal (2)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (2)
- Massachusetts Institute of Technology (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (6)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- QSpace: Queen's University - Canada (3)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (219)
- Queensland University of Technology - ePrints Archive (241)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (3)
- Repositorio Institucional de la Universidad Nacional Agraria (2)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (6)
- Research Open Access Repository of the University of East London. (1)
- Royal College of Art Research Repository - Uninet Kingdom (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (4)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- South Carolina State Documents Depository (2)
- Universidad Autónoma de Nuevo León, Mexico (2)
- Universidade de Lisboa - Repositório Aberto (3)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Université de Lausanne, Switzerland (8)
- Université de Montréal, Canada (15)
- University of Queensland eSpace - Australia (1)
- University of Washington (2)
- WestminsterResearch - UK (16)
Resumo:
In a recent seminal paper, Gibson and Wexler (1993) take important steps to formalizing the notion of language learning in a (finite) space whose grammars are characterized by a finite number of parameters. They introduce the Triggering Learning Algorithm (TLA) and show that even in finite space convergence may be a problem due to local maxima. In this paper we explicitly formalize learning in finite parameter space as a Markov structure whose states are parameter settings. We show that this captures the dynamics of TLA completely and allows us to explicitly compute the rates of convergence for TLA and other variants of TLA e.g. random walk. Also included in the paper are a corrected version of GW's central convergence proof, a list of "problem states" in addition to local maxima, and batch and PAC-style learning bounds for the model.