„algorithm complexity“

Suchergebnisse

4.228 Treffer

• New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory
  Braverman, Vladimir ; Liu, Zaoxing ; Singh, Tejasvam ; Vinodchandran, N. V. ; Yang, Lin F.
• Low-complexity lattice reduction algorithm for MIMO detectors with tree searching
  Kim, Hyunsub ; Lee, Hyukyeon ; Koo, Jihye ; Kim, Jaeseok
• Photo-id of blue whale by means of the dorsal fin using clustering algorithms and color local complexity estimation for mobile devices
  Carvajal-Gámez, Blanca E. ; Trejo-Salazar, David B. ; Gendron, Diane ; Gallegos-Funes, Francisco J.
• 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)
  Guo, Jiong ; Hermelin, Danny 2017 Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
• Max-Throughput for (Conservative) k-of-n Testing
  Hellerstein, Lisa ; Özkan, Özgür ; Sellie, Linda
• Improved Approximation Algorithms for Projection Games
  Manurangsi, Pasin ; Moshkovitz, Dana
• Tight Bounds for Active Self-Assembly Using an Insertion Primitive
  Hescott, Benjamin ; Malchik, Caleb ; Winslow, Andrew
• Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines
  Anand, S. ; Bringmann, Karl ; Friedrich, Tobias ; Garg, Naveen ; Kumar, Amit
• Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing
  Lee, Troy ; Magniez, Frédéric ; Santha, Miklos
• Improved Subquadratic 3SUM
  Freund, Ari
• An Optimal Algorithm for the Weighted Backup 2-Center Problem on a Tree
  Wang, Hung-Lung
• Resilient Dynamic Programming
  Caminiti, Saverio ; Finocchi, Irene ; Fusco, Emanuele G. ; Silvestri, Francesco
• A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
  Solis-Oba, Roberto ; Bonsma, Paul ; Lowski, Stefanie
• Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints
  Aschner, Rom ; Katz, Matthew J.
• List-Decoding Barnes–Wall Lattices
  Grigorescu, Elena ; Peikert, Chris
• On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
  Garg, Sanjam ; Gentry, Craig ; Halevi, Shai ; Wichs, Daniel
• Efficient topology design methods for next generation access networks – Scalable network planning algorithms and cost estimation of next generation access networks
  Mitcsenkov, Attila 2017 GlobeEdit
• Homomorphic Pattern Mining from a Single Large Data Tree
  Wu, Xiaoying ; Theodoratos, Dimitri
• Engineering Parallel String Sorting
  Bingmann, Timo ; Eberle, Andreas ; Sanders, Peter
• Greedy Matching: Guarantees and Limitations
  Besser, Bert ; Poloczek, Matthias