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

Output-Sensitive Approximate Counting via a Measure-Bounded Hyperedge Oracle, or: How Asymmetry Helps Estimate 𝑘-Clique Counts Faster

Autori: Keren Censor-Hillel Tomer Even Virginia Vassilevska Williams

Zdroj: Proceedings of the 57th Annual ACM Symposium on Theory of Computing. :1985-1996

Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

Prístupová URL adresa: http://arxiv.org/abs/2503.21655

Approximate Counting for Spin Systems in Sub-Quadratic Time

Autori: Anand, Konrad Feng, Weiming Freifeld, Graham a ďalší

Prispievatelia: Anand, Konrad Feng, Weiming Freifeld, Graham a ďalší

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs), 297
51st International Colloquium on Automata, Languages, and Programming
TheoretiCS

Predmety: FOS: Computer and information sciences, Spin system, Randomised algorithm, Approximate counting, Sub-quadratic algorithm, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Popis súboru: application/pdf; application/application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2306.14867
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.11
http://hdl.handle.net/20.500.11850/683858

Auditable Algorithms for Approximate Model Counting

Autori: Meel, Kuldeep S. Chakraborty, Supratik Akshay, S.

Témy: Computer Science - Logic in Computer Science, Computer Science - Artificial Intelligence, text

URL: http://arxiv.org/abs/2312.12362

Memory-Efficient Hardware Performance Counters with Approximate-Counting Algorithms

Autori: Sehoon Kim Borivoje Nikolic Jingyi Xu a ďalší

Zdroj: 2021 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS). :226-228

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: https://ieeexplore.ieee.org/abstract/document/9408187
https://dblp.uni-trier.de/db/conf/ispass/ispass2021.html#XuKNS21

Approximate Counting for Spin Systems in Sub-Quadratic Time

Autori: Anand, Konrad Feng, Weiming Freifeld, Graham a ďalší

Prispievatelia: Anand, Konrad Feng, Weiming Freifeld, Graham a ďalší

Zdroj: Leibniz International Proceedings in Informatics (LIPIcs), 297 ; 51st International Colloquium on Automata, Languages, and Programming

Predmety: Randomised algorithm, Approximate counting, Spin system, Sub-quadratic algorithm

Popis súboru: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2306.14867; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-322-5; http://hdl.handle.net/20.500.11850/683858

Dostupnosť: https://hdl.handle.net/20.500.11850/683858
https://doi.org/10.3929/ethz-b-000683858

Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures

Autori: Borgs, Christian Chayes, Jennifer Helmuth, Tyler a ďalší

Predmety: Mathematical Physics, Mathematical Sciences, Physical Sciences, approximate counting, sampling, Potts model, cluster expansion

Popis súboru: application/pdf

Prístupová URL adresa: https://escholarship.org/uc/item/7dw6k2z1
https://escholarship.org/content/qt7dw6k2z1/qt7dw6k2z1.pdf

Approximate Counting in Bounded Arithmetic

Autori: Jeřábek, Emil

Zdroj: The Journal of Symbolic Logic, 2007 Sep 01. 72(3), 959-993.

Prístupová URL adresa: https://www.jstor.org/stable/27588579

Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice

Autori: Sundararaman Akshay Kuldeep S. Meel

Zdroj: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science. :728-741

Predmety: FOS: Computer and information sciences, Computer Science - Machine Learning, Computer Science - Logic in Computer Science, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Machine Learning (cs.LG), Logic in Computer Science (cs.LO)

Prístupová URL adresa: http://arxiv.org/abs/2004.14692
https://dl.acm.org/doi/pdf/10.1145/3373718.3394809
https://dblp.uni-trier.de/db/journals/corr/corr2004.html#abs-2004-14692
https://doi.org/10.1145/3373718.3394809

(ε,δ)-approximate counting algorithm for large scale wireless sensor networks

Autori: Jing-hua ZHU Xue-min GUAN

Zdroj: Tongxin xuebao, Vol 34, Pp 174-183 (2013)

Predmety: wireless sensor networks, data aggregation, approximate algorithms, digital binary tree, Telecommunication, TK5101-6720

Popis súboru: electronic resource

Relation: https://doaj.org/toc/1000-436X

Prístupová URL adresa: https://doaj.org/article/c77e63619433422bbc9f2250ea7b5088

Optimal mixing via tensorization for random independent sets on arbitrary trees

Autori: Efthymiou, Charilaos Hayes, Thomas P. Štefankovič, Daniel a ďalší

Prispievatelia: Efthymiou, Charilaos Hayes, Thomas P. Štefankovič, Daniel a ďalší

Zdroj: Combinatorics, Probability and Computing. 34:259-275

Predmety: FOS: Computer and information sciences, MCMC, Discrete Mathematics (cs.DM), Independent Sets, 0102 computer and information sciences, Approximate Counting Algorithms, Hard-Core Model, 01 natural sciences, Sampling Algorithms, Mixing Time, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics, Computer Science - Discrete Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2307.07727
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.33

Quantum Approximate Counting for Markov Chains and Application to Collision Counting

Autori: Gall, François Le Ng, Iu-Iong

Predmety: FOS: Computer and information sciences, Quantum Physics, Computer Science - Data Structures and Algorithms, FOS: Physical sciences, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, Quantum Physics (quant-ph), 01 natural sciences

Prístupová URL adresa: http://arxiv.org/abs/2204.02552

Efficient Algorithms for Graph Counting and Sampling from a Parameterized Perspective

Autori: Hebert-Johnson, Ursula

Predmety: Computer science, Chordal graphs, Graph algorithms, Graph counting, Graph sampling, Parameterized algorithms

Popis súboru: application/pdf

Prístupová URL adresa: https://escholarship.org/uc/item/9646w20k
https://escholarship.org/content/qt9646w20k/qt9646w20k.pdf

Approximate Counting of Linear Extensions in Practice.

Autori: Talvitie, Topi Koivisto, Mikko

Zdroj: Journal of Artificial Intelligence Research. 2024, Vol. 81, p643-681. 39p.

Predmety: Machine learning, Algorithms, Experiments, Machine theory, Polynomials

BQP, meet NP: Search-to-decision reductions and approximate counting

Autori: Gharibian, Sevag Kamminga, Jonas Sevag Gharibian and Jonas Kamminga

Prispievatelia: Gharibian, Sevag Kamminga, Jonas Sevag Gharibian and Jonas Kamminga

Predmety: FOS: Computer and information sciences, Quantum Physics, Computer Science - Computational Complexity, Oracle Complexity Class, Search to Decision Reduction, FOS: Physical sciences, ddc:004, Computational Complexity (cs.CC), BQP, Quantum Physics (quant-ph), Approximate Counting, NP

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2401.03943
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.70

Approximate Counting via Markov Chains

Autori: Aldous, David

Zdroj: Statistical Science, 1993 Feb 01. 8(1), 16-19.

Prístupová URL adresa: https://www.jstor.org/stable/2246035

Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks

Autori: Fangyuan Zhang Dechuang Chen Sibo Wang a ďalší

Zdroj: Proceedings of the ACM on Management of Data. 1:1-26

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Approximate neural subgraph counting for similar queries.

Autori: Yang, Bin Zou, Zhaonian Ye, Jianxiong

Zdroj: Information Processing & Management. Jul2025, Vol. 62 Issue 4, pN.PAG-N.PAG. 1p.

Predmety: *Problem solving, Time complexity, Polynomial time algorithms, Deep learning, Percentiles

Approximate Counting for Spin Systems in Sub-Quadratic Time

Autori: Anand, Konrad Feng, Weiming Freifeld, Graham a ďalší

Témy: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2306.14867

Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks

Autori: Zhang, F Chen, D Wang, S a ďalší

Témy: Journal Article

URL: http://hdl.handle.net/11343/344018

Comparing algorithms to approximate accuracies for single-step genomic best linear unbiased predictor.

Autori: Ramos, Pedro Garcia, Andre Retallik, Kelli a ďalší

Zdroj: Journal of Animal Science. 2024, Vol. 102, p1-14. 14p.

Predmet: Phenotypes, Algorithms, Equations, Genotypes, Genealogy