Výsledky vyhľadávania - Approximate Counting Algorithms

Upresniť hľadanie
  1. 1

    ( epsilon , delta )-approximate counting algorithm for large scale wireless sensor networks Autor Zhu, Jing-Hua, Guan, Xue-Min

    ISSN: 1000-436X
    Vydavateľské údaje: Editorial Department of Journal on Communications 01.06.2013
    Vydané v Tongxin Xuebao (01.06.2013)
    “… Two approximate counting algorithms, DBT-ACA and DBT-BACA, based on DBT (digital binary tree) protocol were also proposed…”
    Získať plný text
    Journal Article
  2. 2

    Two approximate algorithms for model counting Autor Wang, Jinyan, Yin, Minghao, Wu, Jingli

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Elsevier B.V 02.01.2017
    Vydané v Theoretical computer science (02.01.2017)
    “… Based on the exact method, we propose two approximate model counting algorithms, and prove the time complexity of the algorithms…”
    Získať plný text
    Journal Article
  3. 3

    Memory-Efficient Hardware Performance Counters with Approximate-Counting Algorithms Autor Xu, Jingyi, Kim, Sehoon, Nikolic, Borivoje, Shao, Yakun Sophia

    Vydavateľské údaje: IEEE 01.03.2021
    “… We propose an efficient hardware performance counter design that uses approximate-counting algorithms to improve the number of events tracked on-chip without incurring significant memory overhead…”
    Získať plný text
    Konferenčný príspevok..
  4. 4

    (ε,δ)-approximate counting algorithm for large scale wireless sensor networks Autor Jing-hua ZHU, Xue-min GUAN

    ISSN: 1000-436X
    Vydavateľské údaje: Editorial Department of Journal on Communications 01.06.2013
    Vydané v Tongxin Xuebao (01.06.2013)
    “…The problem of approximate counting for large scale wireless sensor networks was studied.Two approximate counting algorithms,DBT-ACA and DBT-BACA,based on DBT (digital binary tree…”
    Získať plný text
    Journal Article
  5. 5

    Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies Autor Bressan, Marco, Roth, Marc

    ISSN: 2575-8454
    Vydavateľské údaje: IEEE 01.02.2022
    “…We study the problems of counting the homomorphisms, the copies, and the induced copies of a k -vertex graph H in a d -degenerate n -vertex graph G…”
    Získať plný text
    Konferenčný príspevok..
  6. 6

    DSAC: Low-Cost Rowhammer Mitigation Using In-DRAM Stochastic and Approximate Counting Algorithm Autor Hong, Seungki, Kim, Dongha, Lee, Jaehyung, Reum Oh, Yoo, Changsik, Hwang, Sangjoon, Lee, Jooyoung

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 13.02.2023
    Vydané v arXiv.org (13.02.2023)
    “… Accordingly, prior works focused on TRR algorithm that can identify the most frequently accessed row, Rowhammer, to detect the victim rows…”
    Získať plný text
    Paper
  7. 7

    Approximate triangle counting algorithms on multi-cores Autor Rahman, Mahmudur, Al Hasan, Mohammad

    Vydavateľské údaje: IEEE 01.10.2013
    “… In this work, we propose an approximate triangle counting algorithm, that runs on multi-core computers through a multi-threaded implementation…”
    Získať plný text
    Konferenčný príspevok..
  8. 8

    Auditable Algorithms for Approximate Model Counting Autor Meel, Kuldeep S, Chakraborty, Supratik, Akshay, S

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 19.12.2023
    Vydané v arXiv.org (19.12.2023)
    “… #P-hardness of the problem, developing algorithms for approximate counting is an important research area…”
    Získať plný text
    Paper
  9. 9

    Approximate aggregation for tracking quantiles and range countings in wireless sensor networks Autor He, Zaobo, Cai, Zhipeng, Cheng, Siyao, Wang, Xiaoming

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Elsevier B.V 01.11.2015
    Vydané v Theoretical computer science (01.11.2015)
    “… The other goal is to track (ϵ,δ)-approximate range countings satisfying the requirement of arbitrary precision specified by different users…”
    Získať plný text
    Journal Article
  10. 10

    A Framework for Description and Analysis of Sampling-Based Approximate Triangle Counting Algorithms Autor Chehreghani, Mostafa Haghir

    Vydavateľské údaje: IEEE 01.10.2016
    “… In this paper, we present a randomized framework for expressing and analyzing approximate triangle counting algorithms…”
    Získať plný text
    Konferenčný príspevok..
  11. 11

    Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density Autor Jenssen, Matthew, Perkins, Will, Potukuchi, Aditya, Simkin, Michael

    ISSN: 2575-8454
    Vydavateľské údaje: IEEE 27.10.2024
    “…? These are prototypical instances of forbidden substructure problems ubiquitous in combinatorics. The algorithmic questions are instances of approximate sampling and counting for a hypergraph hard-core model…”
    Získať plný text
    Konferenčný príspevok..
  12. 12

    Fast algorithms at low temperatures via Markov chains Autor Chen, Zongchen, Galanis, Andreas, Goldberg, Leslie A., Perkins, Will, Stewart, James, Vigoda, Eric

    ISSN: 1042-9832, 1098-2418
    Vydavateľské údaje: New York John Wiley & Sons, Inc 01.03.2021
    Vydané v Random structures & algorithms (01.03.2021)
    “…Efficient algorithms for approximate counting and sampling in spin systems typically apply in the so‐called high…”
    Získať plný text
    Journal Article
  13. 13

    The Origins of Counting Algorithms Autor Cantlon, Jessica F., Piantadosi, Steven T., Ferrigno, Stephen, Hughes, Kelly D., Barnard, Allison M.

    ISSN: 0956-7976, 1467-9280, 1467-9280
    Vydavateľské údaje: Los Angeles, CA SAGE Publications 01.06.2015
    Vydané v Psychological science (01.06.2015)
    “… The evolutionary origins of counting algorithms are not understood. We report that nonhuman primates exhibit a cognitive ability that is algorithmically and logically similar to human counting…”
    Získať plný text
    Journal Article
  14. 14

    Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams Autor Wang, Jingjing, Wang, Yanhao, Jiang, Wenjun, Li, Yuchen, Kian-Lee, Tan

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 22.11.2022
    Vydané v arXiv.org (22.11.2022)
    “… In this paper, we focus on approximate temporal motif counting…”
    Získať plný text
    Paper
  15. 15

    Approximate counting in SMT and value estimation for probabilistic programs Autor Chistikov, Dmitry, Dimitrova, Rayna, Majumdar, Rupak

    ISSN: 0001-5903, 1432-0525
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2017
    Vydané v Acta informatica (01.12.2017)
    “… We focus on the theories of integer arithmetic and linear real arithmetic. We propose model counting algorithms that provide approximate solutions with formal bounds on the approximation error…”
    Získať plný text
    Journal Article
  16. 16

    Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Extended Version) Autor Wang, Jingjing, Wang, Yanhao, Jiang, Wenjun, Li, Yuchen, Kian-Lee, Tan

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 28.07.2020
    Vydané v arXiv.org (28.07.2020)
    “… In this paper, we focus on approximate temporal motif counting via random sampling. We first propose a generic edge sampling (ES…”
    Získať plný text
    Paper
  17. 17

    Approximate counting with m counters: A detailed analysis Autor Prodinger, Helmut

    ISSN: 0304-3975, 1879-2294
    Vydavateľské údaje: Elsevier B.V 29.06.2012
    Vydané v Theoretical computer science (29.06.2012)
    “…The classical algorithm approximate counting has been recently modified by Cichoń and Macyna: instead of one counter, m counters are used, and the assignment of an incoming item to one of the counters is random…”
    Získať plný text
    Journal Article
  18. 18

    Towards derandomising Markov chain Monte Carlo Autor Feng, Weiming, Guo, Heng, Wang, Chunyang, Wang, Jiaheng, Yin, Yitong

    ISSN: 2575-8454
    Vydavateľské údaje: IEEE 06.11.2023
    “… approximate counting algorithms for hypergraph independent sets and hypergraph colourings, under local lemma type…”
    Získať plný text
    Konferenčný príspevok..
  19. 19

    Granular counting of uncertain data Autor Mencar, C., Pedrycz, W.

    ISSN: 0165-0114
    Vydavateľské údaje: Elsevier B.V 15.05.2020
    Vydané v Fuzzy sets and systems (15.05.2020)
    “…: an exact counting algorithm with quadratic-time complexity and an approximate counting algorithm with linear-time complexity…”
    Získať plný text
    Journal Article
  20. 20

    Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions Autor De, Anindya, Diakonikolas, Ilias, Servedio, Rocco A.

    ISSN: 1093-0159
    Vydavateľské údaje: IEEE 01.06.2014
    “… Our algorithm extends a recent result [1] which gave a deterministic approximate counting algorithm for a single degree-2 polynomial threshold…”
    Získať plný text
    Konferenčný príspevok..