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 16 of 16 for “"DIRECT algorithm"”.

  1. A Direct Algorithm for the K-Nearest-Neighbor Classifier via Local Warping of the Distance Metric

    … is the large model size. There are a number of algorithms that are able to condense the model size of the k-NN classifier at the expense of accuracy. Boosting is therefore desirable for increasing the accuracy of these condensed models. Unfortunately, there does not exist a boosting algorithm …

    byu Repository record for A Direct Algorithm for the K-Nearest-Neighbor Classifier via Local Warping of the Distance Metric (opens in a new tab) Download PDF for A Direct Algorithm for the K-Nearest-Neighbor Classifier via Local Warping of the Distance Metric (opens in a new tab)

  2. Fast direct algorithms for elliptic equations via hierarchical matrix compression

    We present a fast direct algorithm for the solution of linear systems arising from elliptic equations. We extend the work of Xia et al. (2009) on combining the multifrontal method with hierarchical matrices. We offer a more geometric interpretation of that approach, extend it in two dimensions to …

    texas Repository record for Fast direct algorithms for elliptic equations via hierarchical matrix compression (opens in a new tab)

  3. Joint synchronization of clock phase offset, skew and drift in reference broadcast synchronization (RBS) protocol

    … protocol is formulated and found via a direct algorithm. The Gibbs Sampler is also proposed for joint estimation of relative clock phase offset and skew, and shown to provide superior performance compared to the JML-estimator. Lower and upper bounds for the mean-square errors (MSE) of …

    tamu Repository record for Joint synchronization of clock phase offset, skew and drift in reference broadcast synchronization (RBS) protocol (opens in a new tab)

  4. Aerodynamic shape optimization by multi-fidelity modeling and manifold mapping

    … work, a computationally efficient optimization algorithm for aerodynamic design is presented. In our approach, direct optimization of a computationally expensive model is replaced by an iterative updating and re-optimization of a fast physics-based replacement model, following the …

    iastate Repository record for Aerodynamic shape optimization by multi-fidelity modeling and manifold mapping (opens in a new tab)

  5. DIRECT Weather Routing

    … calls for advanced multi-objective optimisation algorithms to be implemented. This thesis presents the theory behind weather routing and a state-of-the-art study on available software and research. It also aims at providing the reader with a basic understanding of what elements make up a weather …

    chalmers Repository record for DIRECT Weather Routing (opens in a new tab)

  6. Deterministic Parallel Global Parameter Estimation for a Model of the Budding Yeast Cell Cycle

    Two parallel deterministic direct search algorithms are combined to find improved parameters for a system of differential equations designed to simulate the cell cycle of budding yeast. Comparing the model simulation results to experimental data is difficult because most of the experimental data is …

    vt Repository record for Deterministic Parallel Global Parameter Estimation for a Model of the Budding Yeast Cell Cycle (opens in a new tab)

  7. Global Optimization of Transmitter Placement for Indoor Wireless Communication Systems

    The DIRECT (DIviding RECTangles) algorithm JONESJOTi, a variant of Lipschitzian methods for bound constrained global optimization, has been applied to the optimal transmitter placement for indoor wireless systems. Power coverage and BER (bit error rate) are considered as two criteria for optimizing …

    vt Repository record for Global Optimization of Transmitter Placement for Indoor Wireless Communication Systems (opens in a new tab)

  8. Sequential and distributed algorithms for fast graph partitioning

    … graph partitioning (GP) problem: given an undirected weighted graph G = (V, E), partition the nodes of G into k parts of almost equal size such that the partition-cost (sum of the weights on edges with nodes in different parts) is minimized. We propose some simple and fast algorithms for this …

    uvic Repository record for Sequential and distributed algorithms for fast graph partitioning (opens in a new tab)

  9. Development of a New 3D Reconstruction Algorithm for Computed Tomography (CT)

    … image reconstruction is dominated by iterative algorithms. Although long reconstruction times remain as a barrier in practical applications, techniques to speed up its convergence are object of investigation, obtaining impressive results. In this thesis, a direct algorithm is proposed for …

    upv Repository record for Development of a New 3D Reconstruction Algorithm for Computed Tomography (CT) (opens in a new tab)

  10. Design and Evaluation of a Data-distributed Massively Parallel Implementation of a Global Optimization Algorithm---DIRECT

    … design of a data-distributed massively parallel DIRECT, the deterministic global optimization algorithm widely used in multidisciplinary engineering design, biological science, and physical science applications. The original algorithm is modified to adapt to different problem scales and …

    vt Repository record for Design and Evaluation of a Data-distributed Massively Parallel Implementation of a Global Optimization Algorithm---DIRECT (opens in a new tab)

  11. Improvement, development and implementation of derivative-free global optimization algorithms /

    … efficiency, the derivative-free global-search DIRECT (DIviding RECTangles) algorithm has received much consideration from the optimization community, and various novel ideas and extensions have been proposed. However, the efficiency of many DIRECT-type algorithms solving multi-modal problems …

    vilnius Repository record for Improvement, development and implementation of derivative-free global optimization algorithms / (opens in a new tab)

  12. Globaliojo optimizavimo algoritmų,nereikalaujančių išvestinių informacijos, kūrimas, tobulinimas ir realizacija /

    … efficiency, the derivative-free global-search DIRECT (DIviding RECTangles) algorithm has received much consideration from the optimization community, and various novel ideas and extensions have been proposed. However, the efficiency of many DIRECT-type algorithms solving multi-modal problems …

    vilnius Repository record for Globaliojo optimizavimo algoritmų,nereikalaujančių išvestinių informacijos, kūrimas, tobulinimas ir realizacija / (opens in a new tab)

  13. Estimation of clock parameters and performance benchmarks for synchronization in wireless sensor networks

    … very complex, two compu- tationally e±cient algorithms have been proposed to estimate the clock o®set and skew regardless of the distribution of the delays. Afterwards, extending the idea of having inactive nodes in a WSN overhear the two-way timing message communication between two active …

    tamu Repository record for Estimation of clock parameters and performance benchmarks for synchronization in wireless sensor networks (opens in a new tab)

  14. Suffix trees and suffix arrays in primary and secondary storage

    … word and sentence boundaries. Although many algorithms are able to deal with this lack of natural boundaries, they are not able to process the large quantity of data in reasonable time. To speed up the runtime of these algorithms, suffix trees and suffix arrays are routinely used to generate …

    iastate Repository record for Suffix trees and suffix arrays in primary and secondary storage (opens in a new tab)

  15. Innovative techniques for industrial process modeling and monitoring

    … wall temperatures, and it can be solved using a direct algorithm in only a few seconds. The simplicity of the model form and the fast algorithm make the model desirable for real-time updating and control of industrial scale furnaces. In process industry, many control loops perform poorly due to …

    texas Repository record for Innovative techniques for industrial process modeling and monitoring (opens in a new tab)

  16. Advanced machine learning techniques for data analysis and processing

    … the parameter selection problem by applying the DIRECT global optimization algorithm to the joint tuning of SAX parameters across four feature-extraction strategies, evaluated on twenty-four UEA multivariate benchmark datasets. The proposed approach achieves competitive classification accuracy …

    greece Repository record for Advanced machine learning techniques for data analysis and processing (opens in a new tab)