Sökning: "Datalogi"

Visar resultat 1 - 5 av 1722 avhandlingar innehållade ordet Datalogi.

1. 1. A new kernel method for object recognition:spin glass-Markov random fields

   Detta är en avhandling från Stockholm : Numerisk analys och datalogi

   Författare :Barbara Caputo; Stefan Arnborg; Kalle Åström; [2004]
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Datalogi; TECHNOLOGY Information technology Computer science Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap Datalogi;

   Sammanfattning : Recognizing objects through vision is an important part of our lives: we recognize people when we talk to them, we recognize our cup on the breakfast table, our car in a parking lot, and so on. While this task is performed with great accuracy and apparently little effort by humans, it is still unclear how this performance is achieved. LÄS MER

3. 2. Automatic and unsupervised methods in natural language processing

   Detta är en avhandling från Stockholm : KTH

   Författare :Johnny Bigert; Viggo Kann; joakim Nivre; [2005]
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Datalogi; TECHNOLOGY Information technology Computer science Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap Datalogi;

   Sammanfattning : Natural language processing (NLP) means the computer-aided processing of language produced by a human. But human language is inherently irregular and the most reliable results are obtained when a human is involved in at least some part of the processing. However, manual workis time-consuming and expensive. LÄS MER

4. 3. Categorical Unification

   Detta är en avhandling från Stockholm : KTH

   Författare :María Ángeles Galán García; Patrik Eklund; José Meseguer; [2004]
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Monad compositions; generalised terms; many-valued logic; Datalogi; TECHNOLOGY Information technology Computer science Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap Datalogi; business data processing; administrativ databehandling;

   Sammanfattning : This thesis deals with different aspects towards many-valued unification which have been studied in the scope of category theory. The main motivation of this investigation comes from the fact that in logic programming, classical unification has been identified as the provision of coequalizers in Kleisli categories of term monads. LÄS MER

5. 4. Beating a Random Assignment Approximating Constraint Satisfaction Problems

   Detta är en avhandling från Stockholm : KTH

   Författare :Gustav Hast; Johan Håstad; Uri Zwick; [2005]
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; TECHNOLOGY Information technology Computer science Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap Datalogi;

   Sammanfattning : An instance of a Boolean constraint satisfaction problem, CSP, consists of a set of constraints acting over a set of Boolean variables. The objective is to find an assignment to the variables that satisfies all the constraints. LÄS MER

7. 5. Function Variables for Constraint Programming

   Detta är en avhandling från Uppsala : Institutionen för informationsvetenskap

   Författare :Brahim Hnich; Edward Tsang; [2003]
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Constraint saisfaction; constraint programming; high-level modelling; abstraction; reformulation; function variables.; Datalogi; TECHNOLOGY Information technology Computer science Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap Datalogi; Computer Science; data- och systemvetenskap;

   Sammanfattning : Quite often modelers with constraint programming (CP) use the same modelling patterns for different problems, possibly from different domains. This results in recurring idioms in constraint programs. Our approach can be seen as a three-step approach. First, we identify some of these recurring patterns in constraint programs. LÄS MER