Search for dissertations about: "Viggo Kann"

Showing result 6 - 8 of 8 swedish dissertations containing the words Viggo Kann.

  2. 6. Text Clustering Exploration : Swedish Text Representation and Clustering Results Unraveled

    Author : Magnus Rosell; Viggo Kann; Tapio Salakoski; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Informatics; computer and systems science; Informatik; data- och systemvetenskap;

    Abstract : Text clustering divides a set of texts into clusters (parts), so that texts within each cluster are similar in content. It may be used to uncover the structure and content of unknown text sets as well as to give new perspectives on familiar ones. READ MORE

  4. 7. Language Technology for the Lazy : Avoiding Work by Using Statistics and Machine Learning

    Author : Jonas Sjöbergh; Viggo Kann; Kimmo Koshenniemi; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; computer science; Computer science; Datalogi;

    Abstract : Language technology is when a computer processes human languages in some way. Since human languages are irregular and hard to define in detail, this is often difficult. Despite this, good results can many times be achieved. Often a lot of manual work is used in creating these systems though. READ MORE

  5. 8. Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction

    Author : Cenny Wenner; Johan Håstad; Viggo Kann; Irit Dinur; Stockholms universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Combinatorial Optimization; Complexity Theory; Approximation; Approximability; Inapproximability; Computational Hardness; NP; Optimization; Constraint Satisfaction; Kombinatorisk optimering; Komplexitetsteori; Beräkningsteori; Approximation; Approximerbarhet; Beräkningssvårighet; NP; Optimering; Vilkorssatisfiering; Vilkorsuppfyllning; Vilkorstillfredställand; datalogi; Computer Science;

    Abstract : Combinatorial optimization include such tasks as finding the quickest route to work, scheduling jobs to specialists, and placing bus stops so as to minimize commuter times. We consider problems where one is given a collection of constraints with the objective of finding an assignment satisfying as many constraints as possible, also known as Constraint Satisfaction Problems (CSPs). READ MORE