Výsledky vyhledávání - Approximate Counting Algorithms
-
1
( epsilon , delta )-approximate counting algorithm for large scale wireless sensor networks
ISSN: 1000-436XVydáno: Editorial Department of Journal on Communications 01.06.2013Vydáno 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ískat plný text
Journal Article -
2
Two approximate algorithms for model counting
ISSN: 0304-3975, 1879-2294Vydáno: Elsevier B.V 02.01.2017Vydáno 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ískat plný text
Journal Article -
3
Memory-Efficient Hardware Performance Counters with Approximate-Counting Algorithms
Vydáno: IEEE 01.03.2021Vydáno v 2021 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS) (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ískat plný text
Konferenční příspěvek -
4
(ε,δ)-approximate counting algorithm for large scale wireless sensor networks
ISSN: 1000-436XVydáno: Editorial Department of Journal on Communications 01.06.2013Vydáno 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ískat plný text
Journal Article -
5
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies
ISSN: 2575-8454Vydáno: IEEE 01.02.2022Vydáno v Proceedings / annual Symposium on Foundations of Computer Science (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ískat plný text
Konferenční příspěvek -
6
DSAC: Low-Cost Rowhammer Mitigation Using In-DRAM Stochastic and Approximate Counting Algorithm
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 13.02.2023Vydáno 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ískat plný text
Paper -
7
Approximate triangle counting algorithms on multi-cores
Vydáno: IEEE 01.10.2013Vydáno v 2013 IEEE International Conference on Big Data (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ískat plný text
Konferenční příspěvek -
8
Auditable Algorithms for Approximate Model Counting
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 19.12.2023Vydáno v arXiv.org (19.12.2023)“… #P-hardness of the problem, developing algorithms for approximate counting is an important research area…”
Získat plný text
Paper -
9
Approximate aggregation for tracking quantiles and range countings in wireless sensor networks
ISSN: 0304-3975, 1879-2294Vydáno: Elsevier B.V 01.11.2015Vydáno 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ískat plný text
Journal Article -
10
A Framework for Description and Analysis of Sampling-Based Approximate Triangle Counting Algorithms
Vydáno: IEEE 01.10.2016Vydáno v 2016 IEEE International Conference on Data Science and Advanced Analytics (DSAA) (01.10.2016)“… In this paper, we present a randomized framework for expressing and analyzing approximate triangle counting algorithms…”
Získat plný text
Konferenční příspěvek -
11
Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density
ISSN: 2575-8454Vydáno: IEEE 27.10.2024Vydáno v Proceedings / annual Symposium on Foundations of Computer Science (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ískat plný text
Konferenční příspěvek -
12
Fast algorithms at low temperatures via Markov chains
ISSN: 1042-9832, 1098-2418Vydáno: New York John Wiley & Sons, Inc 01.03.2021Vydáno 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ískat plný text
Journal Article -
13
The Origins of Counting Algorithms
ISSN: 0956-7976, 1467-9280, 1467-9280Vydáno: Los Angeles, CA SAGE Publications 01.06.2015Vydáno 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ískat plný text
Journal Article -
14
Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 22.11.2022Vydáno v arXiv.org (22.11.2022)“… In this paper, we focus on approximate temporal motif counting…”
Získat plný text
Paper -
15
Approximate counting in SMT and value estimation for probabilistic programs
ISSN: 0001-5903, 1432-0525Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2017Vydáno 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ískat plný text
Journal Article -
16
Efficient Sampling Algorithms for Approximate Temporal Motif Counting (Extended Version)
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 28.07.2020Vydáno 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ískat plný text
Paper -
17
Approximate counting with m counters: A detailed analysis
ISSN: 0304-3975, 1879-2294Vydáno: Elsevier B.V 29.06.2012Vydáno 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ískat plný text
Journal Article -
18
Towards derandomising Markov chain Monte Carlo
ISSN: 2575-8454Vydáno: IEEE 06.11.2023Vydáno v Proceedings / annual Symposium on Foundations of Computer Science (06.11.2023)“… approximate counting algorithms for hypergraph independent sets and hypergraph colourings, under local lemma type…”
Získat plný text
Konferenční příspěvek -
19
Granular counting of uncertain data
ISSN: 0165-0114Vydáno: Elsevier B.V 15.05.2020Vydáno 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ískat plný text
Journal Article -
20
Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions
ISSN: 1093-0159Vydáno: IEEE 01.06.2014Vydáno v 2014 IEEE 29th Conference on Computational Complexity (CCC) (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ískat plný text
Konferenční příspěvek