Sökning: "sorting algorithms"

Visar resultat 1 - 5 av 21 avhandlingar innehållade orden sorting algorithms.

  1. 1. Sport-sort : sorting algorithms and sport tournaments

    Författare :Hans Block; Linköpings universitet; []

    Sammanfattning : Arrange a really short, thrilling and fair tournament! Execute parallel sorting in a machine of a new architecture! The author shows how these problems are connected. He designs several new tournament schemes, and analyses them both in theory and in extensive simulations. He uses only elementary mathematical and statistical methods. LÄS MER

  2. 2. New Results on Combinatorial Algorithms

    Författare :Anders Dessmark; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Sorting; Subgraph isomorphism; Partial k-trees; computer technology; Time complexity; Parallel computation; Data- och systemvetenskap; Convex layers; Systems engineering; Broadcasting;

    Sammanfattning : In this thesis improved upper bounds for several important combinatorial problems are provided. Below is a list of the main results showed in the thesis. The problem of determining whether a k-connected partial k-tree is isomorphic to subgraph of another partial k-tree is shown to be solvable in time O(nk+2). LÄS MER

  3. 3. Concurrent Algorithms and Data Structures for Many-Core Processors

    Författare :Daniel Cederman; Chalmers University of Technology; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; composition; sorting; graphics processors; lock-free; software transactional memory; parallel; load balancing; multi-core;

    Sammanfattning : The convergence of highly parallel many-core graphics processors with conventional multi-core processorsis becoming a reality.To allow algorithms and data structures to scale efficiently on these new platforms,several important factors needs to be considered. LÄS MER

  4. 4. Structures of String Matching and Data Compression

    Författare :N Jesper Larsson; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Implementation; Burrows-Wheeler Transform; Sliding Window; Suffix Sorting; Text Compression; Algorithms; Suffix Tree; Systems engineering; computer technology; Data- och systemvetenskap;

    Sammanfattning : This doctoral dissertation presents a range of results concerning efficient algorithms and data structures for string processing, including several schemes contributing to sequential data compression. It comprises both theoretic results and practical implementations. LÄS MER

  5. 5. From Sequence to Sorting : Prediction of Signal Peptides

    Författare :Henrik Nielsen; Philipp Bucher; Stockholms universitet; []

    Sammanfattning : In the present age of genome sequencing, a vast number of predicted genes are initially known only by their putative nucleotide sequence. The newly established field of bioinformatics is concerned with the computational prediction of structural and functional properties of genes and the proteins they encode, based on their nucleotide and amino acid sequences. LÄS MER