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 20 of 42 for “"Approximate algorithm"”.

  1. Scalable approximate algorithm for group influence maximization in online social network: An experimental evaluation

    … of an exact oracle and experimentally evaluate δ-approximate oracle for the multi-objective submodular optimization problem. We show that group influence maximization in the context of online social networks is an instance of this optimization problem with cardinality constraint and δ-oracle. We …

    iastate Repository record for Scalable approximate algorithm for group influence maximization in online social network: An experimental evaluation (opens in a new tab)

  2. Cross layer scheduling and resource allocation algorithms for cellular wireless networks

    … For these networks, opportunistic scheduling algorithms improve system performance by exploiting time variations of the radio channel. Within the broader framework of opportunistic scheduling, this thesis solves three distinct problems and proposes efficient and scalable solutions for them. …

    ubc Repository record for Cross layer scheduling and resource allocation algorithms for cellular wireless networks (opens in a new tab) Download PDF for Cross layer scheduling and resource allocation algorithms for cellular wireless networks (opens in a new tab)

  3. Deadline-aware Bulk Transfer Scheduling in Best-effort SD-WANs

    … transmissions. Furthermore, we propose an approximate algorithm with a significant computational advantage over our exact algorithm with an approximation ratio that only depends on the number of overlapping requests with the same profit to bandwidth ratio. Finally, we provide a thorough …

    calgary Repository record for Deadline-aware Bulk Transfer Scheduling in Best-effort SD-WANs (opens in a new tab)

  4. ALGORITHMS FOR CONVEX SWITCHING SYSTEMS

    … is high. Here in this thesis we introduce an approximate algorithm for the convex switching problems. It is also shown that the algorithms can be applicable for problems with non-convex rewards and POMDPs/HMMs with nonlinear dynamics. Some numerical illustrations and simulations in real-life …

    nus Repository record for ALGORITHMS FOR CONVEX SWITCHING SYSTEMS (opens in a new tab) Download file for ALGORITHMS FOR CONVEX SWITCHING SYSTEMS (opens in a new tab)

  5. Comparison of Exact and Approximate Multi-Objective Optimization for Software Product Lines

    … We address the problem using an exact and an approximate algorithm and compare their accuracy, time consumption, scalability and parameter setting requirements on five case studies with increasing complexity. Our empirical results show that (1) it is feasible to use exact techniques for small …

    waterloo Repository record for Comparison of Exact and Approximate Multi-Objective Optimization for Software Product Lines (opens in a new tab)

  6. Efficient visualization and querying of geographic databases

    … cartogram animation methods, and a new algorithm for creating single value-by-area cartograms. Our algorithms provide highly expressive animations for GIS spatiotemporal databases. We describe an O(n) time approximate algorithm, which can transform a sequence of n time series data points …

    nebraska Repository record for Efficient visualization and querying of geographic databases (opens in a new tab)

  7. On the discovery of relevant structures in dynamic and heterogeneous data

    … from those datasets requires specialized algorithms that take into consideration both the dynamism and the heterogeneity of the data they contain. Although several pattern mining techniques have been proposed in the literature, most of them fall short in providing interesting structures …

    trento Repository record for On the discovery of relevant structures in dynamic and heterogeneous data (opens in a new tab)

  8. Improvements on Scientific System Analysis

    … leading to errors. This gives rise to a new approximate algorithm with improved time/accuracy tradeoff. Known MS analysis systems follow a pull-based design, where the executed queries mandate the data needed on their part. Such a design introduces redundant and high I/O traffic as well as …

    usf Repository record for Improvements on Scientific System Analysis (opens in a new tab)

  9. Robust maximum covering location problem (RMCLP)

    … solution under the worst-case scenario. Three algorithms were implemented to solve the problem and find the optimal solution, including an exact algorithm and two approximate algorithms. The algorithms were evalu- ated using various instances, including the OR-Library and randomly generated …

    lethbridge Repository record for Robust maximum covering location problem (RMCLP) (opens in a new tab)

  10. Adaptive fund allocation for game-based verifiable computation outsourcing

    … earned by the server. In this thesis, we develop algorithms that efficiently allocate the fund (budget and deposit) to meet different requirements (low latency, high wage, high profit-deposit ratio, etc.). To be specific, we propose: (1) an optimal fund allocation algorithm for the fixed budget …

    iastate Repository record for Adaptive fund allocation for game-based verifiable computation outsourcing (opens in a new tab)

  11. Planning and Optimization of LoRa IoT Networks

    … network topologies, we develop an approximate algorithm for planning large-scale LoRa networks efficiently, which is shown to outperform a commonly-used configuration algorithm in LoRaWAN in terms of the overall throughput and energy efficiency of the network. In the second part of …

    calgary Repository record for Planning and Optimization of LoRa IoT Networks (opens in a new tab)

  12. Advancing Algorithms and Applications for Data Valuation in Machine Learning

    … To meet this challenge, we propose efficient algorithms for approximating the Shapley value with provable error bounds for general machine learning (ML) utilities. Alongside its theoretical robustness, our empirical findings indicate that the Shapley value aligns with people’s intuitive …

    ethz Repository record for Advancing Algorithms and Applications for Data Valuation in Machine Learning (opens in a new tab)

  13. Single Input Multiple Output Media Based Modulation

    … are different then with SBM. Finally, a novel algorithm is developed to solve the Maximum Likelihood (ML) symbol detection algorithm for MBM using ideas from sphere decoding. Various methods of improving computation speed at a cost of introducing approximation error are also presented. An …

    waterloo Repository record for Single Input Multiple Output Media Based Modulation (opens in a new tab)

  14. Improved Learning Of Structural Support Vector Machines: Training With Latent Variables And Nonlinear Kernels

    … Support Vector Machine (Structural SVM) algorithm is a discriminative method for structured output learning that allows flexible feature construction with robust control for overfitting. It provides stateof-art prediction accuracies for many structured output prediction tasks in natural …

    cornell Repository record for Improved Learning Of Structural Support Vector Machines: Training With Latent Variables And Nonlinear Kernels (opens in a new tab)

  15. Topics in discrete and convex geometry

    … computationally is given. It begins with an approximate algorithm based on 'gravity', which is combined with some exact techniques. We use this algorithm to find graphs that match the known and suspected optimal densities. In Chapter 5, we introduce the notation 𝔼ⁿ → (ℓᵣ,ℓ𝓈), which is the …

    ubc Repository record for Topics in discrete and convex geometry (opens in a new tab) Download PDF for Topics in discrete and convex geometry (opens in a new tab)

  16. Relational Data Enrichment by Discovery and Transformation

    … outperforms in speed and accuracy existing algorithms for finding related tables and scales to provide efficient search over large open data lakes. We also consider the complementary problem of building a directory structure over a data lake. We define a data lake organization as a …

    toronto-retro Repository record for Relational Data Enrichment by Discovery and Transformation (opens in a new tab)

  17. Geometric and Combinatorial Problems of Matching and Partitioning in Theoretical Computer Science

    … up to now there existed no optimal deterministic algorithm to find such a hyperplane. We present an exact algorithm in the plane and approximate algorithm in higher dimensions. (This part is joint work with Michael Hoffman and Vincent Kusters.) 2\. Tron is a computer game from the 80s of the last …

    fu-berlin Repository record for Geometric and Combinatorial Problems of Matching and Partitioning in Theoretical Computer Science (opens in a new tab)

  18. Markov network structure discovery using independence tests

    <p>We investigate efficient algorithms for learning the structure of a Markov network from data using the independence-based approach. Such algorithms conduct a series of conditional independence tests on data, successively restricting the set of possible structures until there is only a single …

    iastate Repository record for Markov network structure discovery using independence tests (opens in a new tab)

  19. Efficient Influence Related Queries

    … we propose a traverse-based 2-dimensional algorithm with linear time complexity. For general multi-dimensional spaces, we develop a space partition based exact algorithm. To accelerate the computation, we further devise a randomized sampling method with high accuracy. Secondly, for …

    unsw Repository record for Efficient Influence Related Queries (opens in a new tab)

Page 1 of 3