Suchergebnisse - Graph Theory – Graph Algorithms. General Terms Algorithms*

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

    Point Cloud Denoising via Feature Graph Laplacian Regularization von Dinesh, Chinthaka, Cheung, Gene, Bajic, Ivan V.

    ISSN: 1057-7149, 1941-0042, 1941-0042
    Veröffentlicht: United States IEEE 01.01.2020
    Veröffentlicht in IEEE transactions on image processing (01.01.2020)
    “… Building on recent advances in graph signal processing, we design local algorithms for 3D point cloud denoising …”
    Volltext
    Journal Article
  2. 2

    Graph Simplification-Aided ADMM for Decentralized Composite Optimization von Wang, Bin, Fang, Jun, Duan, Huiping, Li, Hongbin

    ISSN: 2168-2267, 2168-2275, 2168-2275
    Veröffentlicht: Piscataway IEEE 01.10.2021
    Veröffentlicht in IEEE transactions on cybernetics (01.10.2021)
    “… Many of these algorithms, however, need to include some extra proximal term in the augmented Lagrangian function such that the resulting algorithm can be implemented in a decentralized manner …”
    Volltext
    Journal Article
  3. 3

    Solving the maximum cut problem using Harris Hawk Optimization algorithm von Islam, Md. Rafiqul, Islam, Md. Shahidul, Boni, Pritam Khan, Sarker, Aldrin Saurov, Anam, Md. Asif

    ISSN: 1932-6203, 1932-6203
    Veröffentlicht: United States Public Library of Science 30.12.2024
    Veröffentlicht in PloS one (30.12.2024)
    “… The objective of the max-cut problem is to cut any graph in such a way that the total weight of the edges that are cut off is maximum in both subsets of vertices that are divided due to the cut of the edges …”
    Volltext
    Journal Article
  4. 4

    Distributed Discrete-Time Convex Optimization With Closed Convex Set Constraints: Linearly Convergent Algorithm Design von Luan, Meng, Wen, Guanghui, Liu, Hongzhe, Huang, Tingwen, Chen, Guanrong, Yu, Wenwu

    ISSN: 2168-2267, 2168-2275, 2168-2275
    Veröffentlicht: United States IEEE 01.04.2024
    Veröffentlicht in IEEE transactions on cybernetics (01.04.2024)
    “… Under the gradient tracking framework, two distributed algorithms are, respectively, designed over balanced and unbalanced graphs, where momentum terms and two time-scales are involved …”
    Volltext
    Journal Article
  5. 5

    Fast and Optimal Extraction for Sparse Equality Graphs von Goharshady, Amir Kafshdar, Lam, Chun Kit, Parreaux, Lionel

    ISSN: 2475-1421, 2475-1421
    Veröffentlicht: New York, NY, USA ACM 08.10.2024
    Veröffentlicht in Proceedings of ACM on programming languages (08.10.2024)
    “… Equality graphs (e-graphs) are used to compactly represent equivalence classes of terms in symbolic reasoning systems …”
    Volltext
    Journal Article
  6. 6

    Stronger Convergence Results for the Center-Based Fuzzy Clustering With Convex Divergence Measure von Saha, Arkajyoti, Das, Swagatam

    ISSN: 2168-2267, 2168-2275, 2168-2275
    Veröffentlicht: United States IEEE 01.12.2019
    Veröffentlicht in IEEE transactions on cybernetics (01.12.2019)
    “… algorithm with a super-class of the so-called "distance like functions" which emerged from the earlier attempts of unifying the theories of center-based clustering methods …”
    Volltext
    Journal Article
  7. 7

    Quantum-Based Algorithm for Optimizing Artificial Neural Networks von Lu, Tzyy-Chyang, Yu, Gwo-Ruey, Juang, Jyh-Ching

    ISSN: 2162-237X, 2162-2388, 2162-2388
    Veröffentlicht: New York, NY IEEE 01.08.2013
    “… This paper presents a quantum-based algorithm for evolving artificial neural networks (ANNs …”
    Volltext
    Journal Article
  8. 8

    Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix von Nguyên, Lê Thành Dũng

    ISSN: 1860-5974, 1860-5974
    Veröffentlicht: Logical Methods in Computer Science Association 01.02.2020
    Veröffentlicht in Logical methods in computer science (01.02.2020)
    “… This paper establishes a bridge between linear logic and mainstream graph theory, building on previous work by Retor\'e (2003 …”
    Volltext
    Journal Article
  9. 9

    Computing Vertex Connectivity: New Bounds from Old Techniques von Henzinger, Monika R., Rao, Satish, Gabow, Harold N.

    ISSN: 0196-6774, 1090-2678
    Veröffentlicht: San Diego, CA Elsevier Inc 01.02.2000
    Veröffentlicht in Journal of algorithms (01.02.2000)
    “… The time for a digraph having n vertices and m edges is O(min{κ3+n,κn}m); for an undirected graph the term m can be replaced by κn …”
    Volltext
    Journal Article
  10. 10

    An α-Potential Game Framework for Non-Cooperative Dynamic Games: Theory and Algorithms von Li, Xinyu

    ISBN: 9798288866678
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2025
    “… Additionally, efficient reinforcement learning (RL) algorithms and stochastic control techniques are proposed to identify strategies for each player that lead to approximate Nash equilibria (NE …”
    Volltext
    Dissertation
  11. 11

    Jewels of stringology von Crochemore, Maxime, Rytter, Wojciech

    ISBN: 9789810247829, 9810247826
    Veröffentlicht: New Jersey ; Singapore World Scientific 2002
    “… The term "stringology" is a popular nickname for text algorithms, or algorithms on strings …”
    Volltext
    E-Book Buch
  12. 12

    Deep Learning Approaches for Defending Against Cascading Failure von Cunningham, James D

    ISBN: 9798384089698
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2024
    “… A significant amount of society’s infrastructure can be modeled using graph structures, from electric and communication grids, to traffic networks, to social networks …”
    Volltext
    Dissertation
  13. 13

    Generalized and modified ant algorithm for solving robot path planning problem von Maurya, Ritesh, Shukla, Anupam

    ISBN: 9781424455379, 1424455375
    Veröffentlicht: IEEE 01.07.2010
    “… As per the general theory of the graph search algorithms, the increase in the number of neighborhood points make the solutions more optimal in terms …”
    Volltext
    Tagungsbericht