969 resultados para context-aware realta aumentata iot google glass pervarise computing
Resumo:
Dissertação de mestrado em Ciências da Educação (área de especialização em Educação de Adultos)
Resumo:
Relatório de estágio de mestrado em Ensino de Informática
Resumo:
Dissertação de mestrado integrado em Engenharia de Telecomunicações e Informática
Resumo:
Dissertação de Mestrado em Estudos Africanos
Resumo:
Magdeburg, Univ., Fak. für Naturwiss., Diss., 2011
Resumo:
Magdeburg, Univ., Fak. für Wirtschaftswiss., Diss., 2011
Resumo:
Magdeburg, Univ., Fak. für Informatik, Diss., 2008
Resumo:
Magdeburg, Univ., Med. Fak., Diss., 2014
Resumo:
Magdeburg, Univ., Fak. für Maschinenbau, Diss., 2014
Resumo:
[s.c.]
Resumo:
Magdeburg, Univ., Fak. für Informatik, Diss., 2015
Resumo:
Otto-von-Guericke-Universität Magdeburg, Fakultät für Maschinenbau, Univ., Dissertation, 2015
Resumo:
v.10:no.37(1960)
Resumo:
Research on the attitudes, motivations and social and political behavior of European cadets have been made throughout the last decade. Nowadays Spain also joins those surveys. Thru the analysis of polling data, we can consider the different attitudes of Spanish cadets in relation with the other European ones. The conclusion is that although the Spanish political transition to democracy has not ended already in the military teaching system, there are a lot of similarities among Spanish and European cadets.
Resumo:
Inductive learning aims at finding general rules that hold true in a database. Targeted learning seeks rules for the predictions of the value of a variable based on the values of others, as in the case of linear or non-parametric regression analysis. Non-targeted learning finds regularities without a specific prediction goal. We model the product of non-targeted learning as rules that state that a certain phenomenon never happens, or that certain conditions necessitate another. For all types of rules, there is a trade-off between the rule's accuracy and its simplicity. Thus rule selection can be viewed as a choice problem, among pairs of degree of accuracy and degree of complexity. However, one cannot in general tell what is the feasible set in the accuracy-complexity space. Formally, we show that finding out whether a point belongs to this set is computationally hard. In particular, in the context of linear regression, finding a small set of variables that obtain a certain value of R2 is computationally hard. Computational complexity may explain why a person is not always aware of rules that, if asked, she would find valid. This, in turn, may explain why one can change other people's minds (opinions, beliefs) without providing new information.