Suchergebnisse - "Greedy-based algorithm"

  • Treffer 1 - 4 von 4
Treffer weiter einschränken
  1. 1

    A sample decreasing threshold greedy-based algorithm for big data summarisation von Li, Teng, Shin, Hyo-Sang, Tsourdos, Antonios

    ISSN: 2196-1115, 2196-1115
    Veröffentlicht: Cham Springer International Publishing 09.02.2021
    Veröffentlicht in Journal of big data (09.02.2021)
    “… subject to k -extendible system constraints. Leveraging a random sampling process and a decreasing threshold strategy, this work proposes an algorithm, named Sample Decreasing Threshold Greedy (SDTG …”
    Volltext
    Journal Article
  2. 2

    A Sample Decreasing Threshold Greedy-Based Algorithm for Big Data Summarisation von Li, Teng, Shin, Hyo-Sang, Tsourdos, Antonios

    Veröffentlicht: Durham Research Square 18.11.2020
    Veröffentlicht in Journal of Big Data (18.11.2020)
    “… subject to k-extendible system constraints. Leveraging the sampling process and the decreasing threshold strategy, we develop an algorithm, named Sample Decreasing Threshold Greedy (SDTG …”
    Volltext
    Web Resource
  3. 3

    QoE-Driven Adaptive Streaming for Point Clouds von Wang, Lisha, Li, Chenglin, Dai, Wenrui, Li, Shaohui, Zou, Junni, Xiong, Hongkai

    ISSN: 1520-9210, 1941-0077
    Veröffentlicht: Piscataway IEEE 2023
    Veröffentlicht in IEEE transactions on multimedia (2023)
    “… With increasing popularity of virtual reality and augmented reality, application of point clouds is in critical demand as it enables users to freely navigate …”
    Volltext
    Journal Article
  4. 4

    Maximizing Non-monotone Submodular Set Functions Subject to Different Constraints: Combined Algorithms von Fadaei, Salman, MohammadAmin Fazli, Safari, MohammadAli

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 29.02.2016
    Veröffentlicht in arXiv.org (29.02.2016)
    “… Our algorithms combine existing local search and greedy based algorithms. Different constraints that we study are exact cardinality and multiple knapsack constraints …”
    Volltext
    Paper