Výsledky vyhľadávania - work and space efficient algorithm

Upresniť hľadanie
  1. 1

    Efficient Distributed Algorithms for Minimum Spanning Tree in Dense Graphs Autor Bateni, MohammadHossein, Monemzadeh, Morteza, Voorintholt, Kees

    ISSN: 2375-9259
    Vydavateľské údaje: IEEE 01.11.2022
    “…In recent years, the Massively Parallel Computation (MPC) model capturing the MapReduce framework has become the de facto standard model for large-scale data analysis, given the ubiquity of efficient and affordable cloud implementations…”
    Získať plný text
    Konferenčný príspevok..
  2. 2

    Efficient fireworks algorithms for dynamic optimisation problems in continuous space Autor Pekdemir, Hakan, Topcuoglu, Haluk Rahmi

    ISSN: 0952-813X, 1362-3079
    Vydavateľské údaje: Abingdon Taylor & Francis 02.04.2024
    “… The Fireworks Algorithm (FWA) is a recently proposed swarm intelligence algorithm for global optimisation of complex static functions that simulates the explosion process of firework…”
    Získať plný text
    Journal Article
  3. 3

    A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem Autor Yang, Jiaoyun, Xu, Yun, Shang, Yi, Chen, Guoliang

    ISSN: 1041-4347, 1558-2191
    Vydavateľské údaje: United States IEEE 01.11.2014
    “… However, there exists little work on space-efficient MLCS algorithms. In this paper, we formulate the MLCS problem into a graph search problem and present two space-efficient anytime MLCS algorithms, SA-MLCS and SLA-MLCS…”
    Získať plný text
    Journal Article
  4. 4

    Syllable-PBWT for space-efficient haplotype long-match query Autor Wang, Victor, Naseri, Ardalan, Zhang, Shaojie, Zhi, Degui

    ISSN: 1367-4811, 1367-4803, 1367-4811
    Vydavateľské údaje: England Oxford University Press 01.01.2023
    Vydané v Bioinformatics (Oxford, England) (01.01.2023)
    “… In this work, we propose a space-efficient variation of PBWT named Syllable-PBWT, which divides every haplotype into syllables, builds the PBWT positional prefix arrays on the compressed syllabic…”
    Získať plný text
    Journal Article
  5. 5

    A new algorithmic framework for basic problems on binary images Autor Asano, T., Buzer, L., Bereg, S.

    ISSN: 0166-218X, 1872-6771
    Vydavateľské údaje: Amsterdam Elsevier B.V 10.01.2017
    Vydané v Discrete Applied Mathematics (10.01.2017)
    “… Those algorithms usually use linear work space for efficient implementation. In this paper we propose algorithms for several basic problems on binary images which are efficient in time and space, using space-efficient algorithms for grid graphs…”
    Získať plný text
    Journal Article
  6. 6

    Efficient hybrid algorithm for transmission expansion planning Autor De Oliveira, E. J., Moraes, C. A., Oliveira, L. W., Honório, L. M., Poubel, R. P. B.

    ISSN: 0948-7921, 1432-0487
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2018
    Vydané v Electrical engineering (01.12.2018)
    “…This work presents an efficient hybrid algorithm (EHA) that consists of a search space reducer (SSR…”
    Získať plný text
    Journal Article
  7. 7

    Correlation Clustering in Data Streams Autor Ahn, Kook Jin, Cormode, Graham, Guha, Sudipto, McGregor, Andrew, Wirth, Anthony

    ISSN: 0178-4617, 1432-0541
    Vydavateľské údaje: New York Springer US 01.07.2021
    Vydané v Algorithmica (01.07.2021)
    “… Such algorithms need to be both time and and space efficient. In this paper, we address the problem of correlation clustering in the dynamic data stream model…”
    Získať plný text
    Journal Article
  8. 8

    Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs Autor Egidi, Lavinia, Louza, Felipe A., Manzini, Giovanni

    ISSN: 0178-4617, 1432-0541
    Vydavateľské údaje: New York Springer US 01.03.2022
    Vydané v Algorithmica (01.03.2022)
    “…The merging of succinct data structures is a well established technique for the space efficient construction of large succinct indexes…”
    Získať plný text
    Journal Article
  9. 9

    Beyond generative models: superfast traversal, optimization, novelty, exploration and discovery (STONED) algorithm for molecules using SELFIES Autor Nigam, AkshatKumar, Pollice, Robert, Krenn, Mario, Gomes, Gabriel dos Passos, Aspuru-Guzik, Alán

    ISSN: 2041-6520, 2041-6539
    Vydavateľské údaje: England Royal Society of Chemistry 20.04.2021
    Vydané v Chemical science (Cambridge) (20.04.2021)
    “… In this work, we propose STONED - a simple and efficient algorithm to perform interpolation and exploration in the chemical space, comparable to deep generative models…”
    Získať plný text
    Journal Article
  10. 10

    An efficient solution space exploring and descent method for packing equal spheres in a sphere Autor Zhou, Jianrong, Ren, Shuo, He, Kun, Liu, Yanli, Li, Chu-Min

    ISSN: 0305-0548, 1873-765X
    Vydavateľské údaje: Elsevier Ltd 01.04.2024
    Vydané v Computers & operations research (01.04.2024)
    “… In this work, we propose an efficient local search heuristic algorithm named solution space exploring and descent for solving this problem, which can quantify…”
    Získať plný text
    Journal Article
  11. 11

    Toward comprehensive exploration of the physisorption space in porous pseudomaterials using an iterative mutation search algorithm Autor Boone, Paul, Wilmer, Christopher E

    ISSN: 1089-7690, 1089-7690
    Vydavateľské údaje: United States 21.12.2021
    Vydané v The Journal of chemical physics (21.12.2021)
    “… This algorithm is significantly more efficient at sampling the structure-property space than previously reported methods…”
    Zistit podrobnosti o prístupe
    Journal Article
  12. 12

    Faster and space efficient indexing for locality sensitive hashing Autor Verma, Bhisham Dev, Pratap, Rameshwar

    ISSN: 0304-3975
    Vydavateľské údaje: Elsevier B.V 09.11.2025
    Vydané v Theoretical computer science (09.11.2025)
    “…This work suggests faster and space-efficient index construction algorithms for LSH for Euclidean distance (a.k.a. E2LSH…”
    Získať plný text
    Journal Article
  13. 13

    A parametric simplex algorithm for linear vector optimization problems Autor Rudloff, Birgit, Ulus, Firdevs, Vanderbei, Robert

    ISSN: 0025-5610, 1436-4646
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2017
    Vydané v Mathematical programming (01.05.2017)
    “… proposed algorithm works in the parameter space and does not aim to find the set of all efficient solutions…”
    Získať plný text
    Journal Article
  14. 14

    Efficient enumeration of bosonic configurations with applications to the calculation of non-radiative rates Autor Shaw, Robert A, Manian, Anjay, Lyskov, Igor, Russo, Salvy P

    ISSN: 1089-7690, 1089-7690
    Vydavateľské údaje: United States 28.02.2021
    Vydané v The Journal of chemical physics (28.02.2021)
    “…This work presents algorithms for the efficient enumeration of configuration spaces following Boltzmann-like statistics, with example applications to the calculation of non-radiative rates…”
    Zistit podrobnosti o prístupe
    Journal Article
  15. 15

    Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension Autor Zhu, Zheng, Ochoa, Andrew J., Katzgraber, Helmut G.

    ISSN: 0031-9007, 1079-7114, 1079-7114
    Vydavateľské údaje: United States 14.08.2015
    Vydané v Physical review letters (14.08.2015)
    “… Here, we present a cluster algorithm for Ising spin glasses that works in any space dimension and speeds up thermalization by at least one order of magnitude at temperatures where thermalization is typically difficult…”
    Získať plný text
    Journal Article
  16. 16

    Provably Fast and Space-Efficient Parallel Biconnectivity Autor Dong, Xiaojun, Wang, Letong, Gu, Yan, Sun, Yihan

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 03.01.2023
    Vydané v arXiv.org (03.01.2023)
    “…Biconnectivity is one of the most fundamental graph problems. The canonical parallel biconnectivity algorithm is the Tarjan-Vishkin algorithm, which has \(O(n+m)\) optimal work…”
    Získať plný text
    Paper
  17. 17

    Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error Autor Kopelowitz, Tsvi, Porat, Ely

    ISSN: 1432-4350, 1433-0490
    Vydavateľské údaje: New York Springer-Verlag 01.04.2008
    Vydané v Theory of computing systems (01.04.2008)
    “… Some recent work and space efficient algorithms were developed for time-decaying aggregations, and in particular polynomial and exponential decaying aggregations…”
    Získať plný text
    Journal Article
  18. 18

    Gene regulatory accelerators on cloud FPGA Autor Costa Penha, Jeronimo, Bragança, Lucas, Canesche, Michael, Ribeiro, Dener, Nacif, José Augusto M., Ferreira, Ricardo S.

    ISSN: 1532-0626, 1532-0634
    Vydavateľské údaje: Hoboken Wiley Subscription Services, Inc 01.11.2023
    Vydané v Concurrency and computation (01.11.2023)
    “… This work proposes efficient FPGA‐based accelerators to implement two GRN algorithms: attractor computation and Derrida plot…”
    Získať plný text
    Journal Article
  19. 19

    Development of an efficient method for object detection and localization in 3D space using RGBD cameras for autonomous systems Autor Boyko, Nataliya

    ISSN: 2666-3074, 2666-3074
    Vydavateľské údaje: Elsevier B.V 01.12.2025
    “…The work presents an efficient algorithm for object detection, orientation estimation, and isometric positioning in 3D space using RGBD camera data…”
    Získať plný text
    Journal Article
  20. 20

    Efficient repairs of infeasible job shop problems by evolutionary algorithms Autor Mencía, Raúl, Mencía, Carlos, Varela, Ramiro

    ISSN: 0952-1976, 1873-6769
    Vydavateľské údaje: Elsevier Ltd 01.09.2021
    “… scheduled under the makespan constraint. Recent work proposed a genetic algorithm for solving this problem, which integrates an efficient solution builder for defining the search space…”
    Získať plný text
    Journal Article