„algorithm complexity“

Suchergebnisse

4.228 Treffer

• Tight Bounds for Online Coloring of Basic Graph Classes
  Albers, Susanne ; Schraink, Sebastian
• Low Complexity High-Performance Precoding Algorithms for mm-Wave MU-MIMO Communication System
  El-abd, Rania H. ; Abdullah, Haythem H. ; Elazim, Mohamed Abd ; Samrah, Ahmed sh
• Guess Free Maximization of Submodular and Linear Sums
  Feldman, Moran
• “Show Me the Crowds!” Revealing Cluster Structures Through AMTICS
  Richter, Florian ; Lu, Yifeng ; Kazempour, Daniyal ; Seidl, Thomas
• Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation
  Paul, Christophe ; Pilipczuk, Michał
• Parameterized Complexity of Independent Set in H-Free Graphs
  Bonnet, Édouard ; Bousquet, Nicolas ; Charbit, Pierre ; Thomassé, Stéphan ; Watrigant, Rémi
• A generalized worst-case complexity analysis for non-monotone line searches
  Grapiglia, Geovani Nunes ; Sachs, Ekkehard W.
• R-OO-KASE: Revocable Online/Offline Key Aggregate Searchable Encryption
  Padhya, Mukti ; Jinwala, Devesh C.
• Iterative Partial Rounding for Vertex Cover with Hard Capacities
  Kao, Mong-Jen
• Enumerating k-Arc-Connected Orientations
  Blind, Sarah ; Knauer, Kolja ; Valicov, Petru
• Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions
  Chevalier, Céline ; Laguillaumie, Fabien ; Vergnaud, Damien
• Efficient algorithm to compute Markov transitional probabilities for a desired PageRank
  Berend, Gábor
• GARG: Anonymous Recommendation of Point-of-Interest in Mobile Networks by Graph Convolution Network
  Wu, Shiwen ; Zhang, Yuanxing ; Gao, Chengliang ; Bian, Kaigui ; Cui, Bin
• Fault Tolerant Approximate BFS Structures with Additive Stretch
  Parter, Merav ; Peleg, David
• On $$\epsilon$$ ϵ -sensitive monotone computations
  Hrubeš, Pavel
• Building a Nest by an Automaton
  Czyzowicz, Jurek ; Dereniowski, Dariusz ; Pelc, Andrzej
• Algorithmische Informationstheorie – Berechenbarkeit und Komplexität verstehen
  Witt, Kurt-Ulrich ; Müller, Martin E. 2020 Springer Spektrum
• On Scheduling Coflows
  Ahmadi, Saba ; Khuller, Samir ; Purohit, Manish ; Yang, Sheng
• On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms
  Corus, Dogan ; Oliveto, Pietro S.
• Low-complexity PAPR reduction method based on the TLBO algorithm for an OFDM signal
  HADJ ALI, Tarik ; HAMZA, Abdelkrim