Sökning: "Data Structures Searching"

Visar resultat 1 - 5 av 21 avhandlingar innehållade orden Data Structures Searching.

  1. 1. Studies in Applied Data Structures

    Författare :Kurt Swanson; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Systems engineering; Sparse Matrix; Suffix Tree; Roundness; Range searching; Data- och systemvetenskap; computer technology;

    Sammanfattning : The design of efficient data structures is of primary importance in creation of theoretical algorithms as well their more tangible descendants, computer programs. In this dissertation we study computational aspects of data structures and their respective algorithms from a theoretical viewpoint, which are however of direct importance in the implementation of solutions for real-world problems. LÄS MER

  2. 2. Finding, extracting and exploiting structure in text and hypertext

    Författare :Ola Ågren; Jürgen Börstler; Frank Drewes; Maarten de Rijke; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Automatic propagation; CHiC; Data mining; Discrete data; Extraction; Hierarchies; ProT; Rank distribution; S²ProT; Spatial linking; Web mining; Web searching; Computer science; Datalogi; business data processing; administrativ databehandling;

    Sammanfattning : Data mining is a fast-developing field of study, using computations to either predict or describe large amounts of data. The increase in data produced each year goes hand in hand with this, requiring algorithms that are more and more efficient in order to find interesting information within a given time. LÄS MER

  3. 3. Striking a balance : Managing collaborative multitasking in computer-supported cooperation

    Författare :Rikard Harr; Victor Kaptelinin; Mikael Wiberg; Oskar Juhlin; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer-supported Cooperative Work; articulation work; individual task execution; balance; interruptions; availability; awareness; interaction; information technology; multitasking; task switching; Informatics; computer and systems science; Informatik; data- och systemvetenskap;

    Sammanfattning : This thesis is a collection of six papers and a cover paper reporting an exploration of how to strike a balance between individual task execution and work articulation in Computer-supported Cooperative Work (CSCW). The interest in this theme is motivated by an increased reliance of IT-supported cooperative work arrangements in modern organizations, the fragmented layout of work for multitasking individuals and reports on various forms of overload, increased level of stress and anxiety experienced by workers active in these organizations. LÄS MER

  4. 4. Scalable Analysis of Large Datasets in Life Sciences

    Författare :Laeeq Ahmed; Erwin Laure; Ola Spjuth; Ake Edlund; Vincent Breton; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Big Data; Apache Spark; Virtual Screening; EEG; Cloud Computing; Life Sciences; Machine Learning; Computer Science; Datalogi;

    Sammanfattning : We are experiencing a deluge of data in all fields of scientific and business research, particularly in the life sciences, due to the development of better instrumentation and the rapid advancements that have occurred in information technology in recent times. There are major challenges when it comes to handling such large amounts of data. LÄS MER

  5. 5. From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry

    Författare :Mikael Hammar; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; system; numerisk analys; Datalogi; systems; control; numerical analysis; Approximation Algorithms; Computational Geometry; Online Algorithms; Art Gallery Problem; Linear Search; Traveling Salesman Problem; R-Tree; Delaunay Triangulation; Polygon Exploration; Computer science; Shortest Watchman Routes; kontroll; Mathematics; Matematik;

    Sammanfattning : We give approximation and online algorithms as well as data structures for some well studied problems in computational geometry. The thesis is divided into three parts. In part one, we study problems related to guarding, exploring and searching geometric environments. LÄS MER