Global ETD Search

1	Visual Algorithms Poggio, Tomaso 01 May 1982 (has links) Nonlinear, local and highly parallel algorithms can perform several simple but important visual computations. Specific classes of algorithms can be considered in an abstract way. I study here the class of polynomial algorithms to exemplify some of the important issues for visual processing like linear vs. nonlinear and local vs. global. Polynomial algorithms are a natural extension of Perceptrons to time dependent grey level images.. Although they share most of the limitations of Perceptrons, they are powerful parallel computational devices. Several of their properties are characterized and especially (a) their equivalence with Perceptrons for geometrical figures and (b) the synthesis of non-linear algorithms (mappings) via associative learning. Finally, the paper considers how algorithms of this type could be implemented in nervous hardware, in terms of synaptic interactions strategically located in a dendritic tree. polynomial algorithms parallel/serial neural hardware sperceptrons nonlinear mappings
2	Polynomiální algoritmus pro binární PCP / A polynomial algorithm for the binary PCP Kuřinová, Petra January 2013 (has links) The Post correspondence problem, introduced in 1946 by Emil Post, is an important example of undecidable problem. Therefore PCP figures in pro- ofs of some results in theory of formal languages, matrix theory and other. The decidability of the Post correspondence problem proved Ehrenfeucht, Karhumäki and Rozenberg in the 1980s and Halava, Harju and Hirvensalo in 2002 ended the proof. Eight years later was verified that the solution can be found even in polynomial time. The main goal of this diploma thesis is to describe this algorithm in detail and to implement it in a web application. The thesis also introduces basics of com- binatorics on words and some facts about PCP and produces some interesting examples of instances of PCP. Keywords: Post correspondence problem, generalized Post correspondence problem, binary PCP, polynomial algorithms on words, successors of morphisms 1
3	Polynomial-Time Reasoning Support for Design and Maintenance of Large-Scale Biomedical Ontologies Suntisrivaraporn, Boontawee 05 February 2009 (has links) (PDF) Description Logics (DLs) belong to a successful family of knowledge representation formalisms with two key assets: formally well-defined semantics which allows to represent knowledge in an unambiguous way and automated reasoning which allows to infer implicit knowledge from the one given explicitly. This thesis investigates various reasoning techniques for tractable DLs in the EL family which have been implemented in the CEL system. It suggests that the use of the lightweight DLs, in which reasoning is tractable, is beneficial for ontology design and maintenance both in terms of expressivity and scalability. The claim is supported by a case study on the renown medical ontology SNOMED CT and extensive empirical evaluation on several large-scale biomedical ontologies. Description Logic Tractable reasoning Polynomial algorithms Biomedical ontologies Ontology design CEL reasoner DL systems Beschreibungslogik polynomielle Schlussfolgerung polynomielle Algorithmen biomedizinische Ontologien Ontologie-Entwurf CEL Reasoner Beschreibungslogik-Systeme ddc:004 rvk:ST 134
4	Polynomial-Time Reasoning Support for Design and Maintenance of Large-Scale Biomedical Ontologies Suntisrivaraporn, Boontawee 21 January 2009 (has links) Description Logics (DLs) belong to a successful family of knowledge representation formalisms with two key assets: formally well-defined semantics which allows to represent knowledge in an unambiguous way and automated reasoning which allows to infer implicit knowledge from the one given explicitly. This thesis investigates various reasoning techniques for tractable DLs in the EL family which have been implemented in the CEL system. It suggests that the use of the lightweight DLs, in which reasoning is tractable, is beneficial for ontology design and maintenance both in terms of expressivity and scalability. The claim is supported by a case study on the renown medical ontology SNOMED CT and extensive empirical evaluation on several large-scale biomedical ontologies. info:eu-repo/classification/ddc/004 ddc:004

1

Page generated in 0.0684 seconds