Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 14 of 14 for “"naive algorithm"”.

  1. Distributed Algorithms for Computing Very Large Thresholded Covariance Matrices

    … matrix will have p(p-1)/2 entries and the naive algorithm to compute the matrix will take O(np^2) time. For large p (greater than 10,000) and n much greater than p, this is debilitating. In this thesis, we consider the problem of computing a large covariance matrix efficiently in a …

    rice Repository record for Distributed Algorithms for Computing Very Large Thresholded Covariance Matrices (opens in a new tab)

  2. Mining for co-occurring motion trajectories : sport analysis

    … investigates the applicability of a data mining algorithm for automatic pattern discovery widely used for conventional databases, called Apriori, to a new domain - 2D motion trajectory data. This is one the first attempts to analyze motion trajectory data, in the data mining style, i.e., to …

    ubc Repository record for Mining for co-occurring motion trajectories : sport analysis (opens in a new tab) Download PDF for Mining for co-occurring motion trajectories : sport analysis (opens in a new tab)

  3. Inverting Permutations In Place

    … on $n$ elements in place. First, we present a naive algorithm to do it using $O(\log n)$ extra bits in $O(n^2)$ time in the worst case. We then improve that algorithm, using a small bit vector, to use $O(\sqrt n)$ extra bits in $O(n \sqrt n)$ time. Using a different approach, we present an …

    waterloo Repository record for Inverting Permutations In Place (opens in a new tab)

  4. Fault propagation analysis of large-scale, networked embedded systems

    … 1. Fault propagation analyses. We developed algorithms for two types of analyses: forward analysis and backward analysis. For backward analysis, we developed two techniques: a naive algorithm and an algorithm that uses Datalog. 2. A system description language. We developed a language that we …

    gatech Repository record for Fault propagation analysis of large-scale, networked embedded systems (opens in a new tab)

  5. Theoretical Fundamentals of Real-time Virtualization from the Resource Management Perspective

    … a real-time VMM. At the resource level, only a naive algorithm has been found for resource partitioning. At the task level, only the Periodic Task Model is investigated, and even for this task model, only one simple case has been considered. This work explores the RRP Model at both the resource …

    houston Repository record for Theoretical Fundamentals of Real-time Virtualization from the Resource Management Perspective (opens in a new tab)

  6. Distribution-independent hierarchical N-body methods

    … time per iteration required by the naive algorithm of computing each pairwise interaction. Widely respected among these are the Barnes-Hut and Greengard methods. Greengard claims his algorithm reduces the complexity to O(N) time per iteration;Throughout this thesis, we concentrate on …

    iastate Repository record for Distribution-independent hierarchical N-body methods (opens in a new tab)

  7. Computing hybridization networks using agreement forests

    … purpose, our approach implements the first non-naive algorithm - called allMAAFs - calculating all maximum acyclic agreement forests for two rooted binary phylogenetic trees on the same set of taxa. In a subsequent step, in order to maximize the efficiency of the algorithm allMAAFs, we have …

    lmu-germany Repository record for Computing hybridization networks using agreement forests (opens in a new tab)

  8. Query optimization for Federated Database Systems: the Cyrano prototype

    … that query optimization techniques such as Semi-Naive algorithm and Magic-Sets Rewrite algorithm could be used to improve the performance of Cyrano prototype query processing. Query optimization has not been used for an FDBS with a deductive object-oriented meta model. Most existing FDBS query …

    vt Repository record for Query optimization for Federated Database Systems: the Cyrano prototype (opens in a new tab)

  9. The design of feedback channels for wireless networks : an optimization-theoretic view

    … convex relaxations and compressed sensing. A naive algorithm to solve these large combinatorial problems would typically involve searching over a exponential number of possibilities to find the optimal feedback allocation. As a general theme, we identify and exploit special …

    texas Repository record for The design of feedback channels for wireless networks : an optimization-theoretic view (opens in a new tab)

  10. True random number generation using genetic algorithms on high performance architectures

    … stage based on a heuristic evolutionary algorithm. Our post-processing algorithm is composed of two phases: (i) Histogram Specification and (ii) Stationarity Enforcement. We propose two techniques for histogram equalization, Exact Histogram Equalization (EHE) and Adaptive EHE (AEHE) that …

    manitoba Repository record for True random number generation using genetic algorithms on high performance architectures (opens in a new tab)

  11. Assembling Information from Big Corpora by Focusing Machine Reading

    … not know ahead of time. Making it harder for a naive algorithm to exhaustively process a corpus if it is of a reasonable size, e.g. the English Wikipedia or PubMed Central. We formulate the elements of a novel search framework, focused reading (FR), as a Markov Decision Process, whose …

    arizona-thes Repository record for Assembling Information from Big Corpora by Focusing Machine Reading (opens in a new tab)

  12. Modelling an agent to trade on behalf of V2G drivers

    … in three different scenarios using an optimal algorithm based on backward induction concept and we compare the results for our solution to a simple benchmark. These scenarios have been proposed to model the user behaviour for the duration of a single day where we assume that users drive their …

    soton Download PDF for Modelling an agent to trade on behalf of V2G drivers (opens in a new tab)

  13. Bioinformatics analyses of alternative splicing : non-EST based prediction, influence of secondary structures and tandem splice sites

    … introducing an efficient dynamic programming algorithm, we reduce the computational complexity during the search for new splice events compared to a naive algorithm. The use of this algorithm is demonstrated in a genome-wide application, where we predict and verify novel human splice events. …

    freiburg-diss Repository record for Bioinformatics analyses of alternative splicing : non-EST based prediction, influence of secondary structures and tandem splice sites (opens in a new tab)

  14. Demonstrační program vyhledávání řetězců v textu

    V mé práci se zabývám problematikou vyhledávacích algoritmů. Cílem bylo vytvořit program pro demonstraci principu algoritmů pro vyhledávání v textu uvedených v opoře pro předmět Algoritmy. Vytvořený program tyto algoritmy názorně demonstruje pomocí animací.

    brno-tech Repository record for Demonstrační program vyhledávání řetězců v textu (opens in a new tab)