Статті в журналах з теми "Approximate counting"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Approximate counting".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
BUSS, SAMUEL R., LESZEK ALEKSANDER KOŁODZIEJCZYK, and NEIL THAPEN. "FRAGMENTS OF APPROXIMATE COUNTING." Journal of Symbolic Logic 79, no. 2 (June 2014): 496–525. http://dx.doi.org/10.1017/jsl.2013.37.
Повний текст джерелаAronov, Boris, and Micha Sharir. "Approximate Halfspace Range Counting." SIAM Journal on Computing 39, no. 7 (January 2010): 2704–25. http://dx.doi.org/10.1137/080736600.
Повний текст джерелаLouchard, Guy, and Helmut Prodinger. "Generalized approximate counting revisited." Theoretical Computer Science 391, no. 1-2 (February 2008): 109–25. http://dx.doi.org/10.1016/j.tcs.2007.10.035.
Повний текст джерелаJeřábek, Emil. "Approximate counting in bounded arithmetic." Journal of Symbolic Logic 72, no. 3 (September 2007): 959–93. http://dx.doi.org/10.2178/jsl/1191333850.
Повний текст джерелаCichoń, Jacek, and Karol Gotfryd. "Average Counting via Approximate Histograms." ACM Transactions on Sensor Networks 14, no. 2 (July 21, 2018): 1–32. http://dx.doi.org/10.1145/3177922.
Повний текст джерелаKirschenhofer, Peter, and Helmut Prodinger. "Approximate counting : an alternative approach." RAIRO - Theoretical Informatics and Applications 25, no. 1 (1991): 43–48. http://dx.doi.org/10.1051/ita/1991250100431.
Повний текст джерелаBORDEWICH, M., M. FREEDMAN, L. LOVÁSZ, and D. WELSH. "Approximate Counting and Quantum Computation." Combinatorics, Probability and Computing 14, no. 5-6 (October 11, 2005): 737. http://dx.doi.org/10.1017/s0963548305007005.
Повний текст джерелаFlajolet, Philippe. "Approximate counting: A detailed analysis." BIT 25, no. 1 (March 1985): 113–34. http://dx.doi.org/10.1007/bf01934993.
Повний текст джерелаErdős, Péter L., Sándor Z. Kiss, István Miklós, and Lajos Soukup. "Approximate Counting of Graphical Realizations." PLOS ONE 10, no. 7 (July 10, 2015): e0131300. http://dx.doi.org/10.1371/journal.pone.0131300.
Повний текст джерелаAldous, David. "Approximate Counting via Markov Chains." Statistical Science 8, no. 1 (February 1993): 16–19. http://dx.doi.org/10.1214/ss/1177011078.
Повний текст джерелаDudek, Andrzej, Alan Frieze, Andrzej Ruciński, and Matas Šileikis. "Approximate counting of regular hypergraphs." Information Processing Letters 113, no. 19-21 (September 2013): 785–88. http://dx.doi.org/10.1016/j.ipl.2013.07.018.
Повний текст джерелаBarvinok, Alexander. "Approximate counting via random optimization." Random Structures and Algorithms 11, no. 2 (September 1997): 187–98. http://dx.doi.org/10.1002/(sici)1098-2418(199709)11:2<187::aid-rsa6>3.0.co;2-o.
Повний текст джерелаShaw, Arijit, Brendan Juba, and Kuldeep S. Meel. "An Approximate Skolem Function Counter." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 8 (March 24, 2024): 8108–16. http://dx.doi.org/10.1609/aaai.v38i8.28650.
Повний текст джерелаGall, Francois Le, and Iu-Iong Ng. "Quantum approximate counting for Markov chains and collision counting." Quantum Information and Computation 22, no. 15&16 (November 2022): 1261. http://dx.doi.org/10.26421/qic22.15-16-1.
Повний текст джерелаWang, Jinyan, Minghao Yin, and Jingli Wu. "Two approximate algorithms for model counting." Theoretical Computer Science 657 (January 2017): 28–37. http://dx.doi.org/10.1016/j.tcs.2016.04.047.
Повний текст джерелаShaltiel, Ronen, and Christopher Umans. "Pseudorandomness for Approximate Counting and Sampling." computational complexity 15, no. 4 (December 2006): 298–341. http://dx.doi.org/10.1007/s00037-007-0218-9.
Повний текст джерелаViola, Emanuele. "Randomness Buys Depth for Approximate Counting." computational complexity 23, no. 3 (January 8, 2014): 479–508. http://dx.doi.org/10.1007/s00037-013-0076-6.
Повний текст джерелаChan, Timothy M., and Bryan T. Wilkinson. "Adaptive and Approximate Orthogonal Range Counting." ACM Transactions on Algorithms 12, no. 4 (September 2, 2016): 1–15. http://dx.doi.org/10.1145/2830567.
Повний текст джерелаAfshani, Peyman, and Timothy M. Chan. "On Approximate Range Counting and Depth." Discrete & Computational Geometry 42, no. 1 (April 30, 2009): 3–21. http://dx.doi.org/10.1007/s00454-009-9177-z.
Повний текст джерелаMiyata, Takahisa, and Tadashi Watanabe. "Approximate resolutions and box-counting dimension." Topology and its Applications 132, no. 1 (July 2003): 49–69. http://dx.doi.org/10.1016/s0166-8641(02)00362-0.
Повний текст джерелаMeel, Kuldeep S., Supratik Chakraborty, and S. Akshay. "Auditable Algorithms for Approximate Model Counting." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 9 (March 24, 2024): 10654–61. http://dx.doi.org/10.1609/aaai.v38i9.28936.
Повний текст джерелаKabir, Mohimenul, Flavio O. Everardo, Ankit K. Shukla, Markus Hecher, Johannes Klaus Fichte, and Kuldeep S. Meel. "ApproxASP – a Scalable Approximate Answer Set Counter." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 5 (June 28, 2022): 5755–64. http://dx.doi.org/10.1609/aaai.v36i5.20518.
Повний текст джерелаJeřábek, Emil. "Approximate counting by hashing in bounded arithmetic." Journal of Symbolic Logic 74, no. 3 (September 2009): 829–60. http://dx.doi.org/10.2178/jsl/1245158087.
Повний текст джерелаAndrés Montoya, J. "On the parameterized complexity of approximate counting." RAIRO - Theoretical Informatics and Applications 45, no. 2 (April 2011): 197–223. http://dx.doi.org/10.1051/ita/2011007.
Повний текст джерелаBarvinok, A., and A. Samorodnitsky. "The distance approach to approximate combinatorial counting." Geometric And Functional Analysis 11, no. 5 (December 1, 2001): 871–99. http://dx.doi.org/10.1007/s00039-001-8219-3.
Повний текст джерелаDyer, Martin, Leslie Ann Goldberg, Catherine Greenhill, and Mark Jerrum. "The Relative Complexity of Approximate Counting Problems." Algorithmica 38, no. 3 (December 10, 2003): 471–500. http://dx.doi.org/10.1007/s00453-003-1073-y.
Повний текст джерелаAbboud, Ralph, Ismail Ceylan, and Thomas Lukasiewicz. "Learning to Reason: Leveraging Neural Networks for Approximate DNF Counting." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 04 (April 3, 2020): 3097–104. http://dx.doi.org/10.1609/aaai.v34i04.5705.
Повний текст джерелаSaha, Seemanta, Surendra Ghentiyala, Shihua Lu, Lucas Bang, and Tevfik Bultan. "Obtaining Information Leakage Bounds via Approximate Model Counting." Proceedings of the ACM on Programming Languages 7, PLDI (June 6, 2023): 1488–509. http://dx.doi.org/10.1145/3591281.
Повний текст джерелаDell, Holger, and John Lapinskas. "Fine-Grained Reductions from Approximate Counting to Decision." ACM Transactions on Computation Theory 13, no. 2 (June 2021): 1–24. http://dx.doi.org/10.1145/3442352.
Повний текст джерелаAspnes, James, and Keren Censor. "Approximate shared-memory counting despite a strong adversary." ACM Transactions on Algorithms 6, no. 2 (March 2010): 1–23. http://dx.doi.org/10.1145/1721837.1721841.
Повний текст джерелаBulatov, Andrei A., and Stanislav Živný. "Approximate Counting CSP Seen from the Other Side." ACM Transactions on Computation Theory 12, no. 2 (May 14, 2020): 1–19. http://dx.doi.org/10.1145/3389390.
Повний текст джерелаProdinger, Helmut. "Approximate counting with m counters: A detailed analysis." Theoretical Computer Science 439 (June 2012): 58–68. http://dx.doi.org/10.1016/j.tcs.2012.03.016.
Повний текст джерелаSonntag, Dag, Jose M. Peña, and Manuel Gómez-Olmedo. "Approximate Counting of Graphical Models via MCMC Revisited." International Journal of Intelligent Systems 30, no. 3 (December 24, 2014): 384–420. http://dx.doi.org/10.1002/int.21704.
Повний текст джерелаLai, Yong, Kuldeep S. Meel, and Roland H. C. Yap. "Fast Converging Anytime Model Counting." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 4 (June 26, 2023): 4025–34. http://dx.doi.org/10.1609/aaai.v37i4.25517.
Повний текст джерелаZhang, Fangyuan, Dechuang Chen, Sibo Wang, Yin Yang, and Junhao Gan. "Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks." Proceedings of the ACM on Management of Data 1, no. 4 (December 8, 2023): 1–26. http://dx.doi.org/10.1145/3626753.
Повний текст джерелаGe, Cunjing. "Approximate Integer Solution Counts over Linear Arithmetic Constraints." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 8 (March 24, 2024): 8022–29. http://dx.doi.org/10.1609/aaai.v38i8.28640.
Повний текст джерелаVartziotis, Dimitris, and Joachim Wipper. "The Fractal Nature of an Approximate Prime Counting Function." Fractal and Fractional 1, no. 1 (November 8, 2017): 10. http://dx.doi.org/10.3390/fractalfract1010010.
Повний текст джерелаWojciechowski, J. "An approximate formula for counting trees in a graph." IEEE Transactions on Circuits and Systems 32, no. 4 (April 1985): 382–85. http://dx.doi.org/10.1109/tcs.1985.1085721.
Повний текст джерелаWei, Zhewei, and Ke Yi. "Tight Space Bounds for Two-Dimensional Approximate Range Counting." ACM Transactions on Algorithms 14, no. 2 (June 4, 2018): 1–17. http://dx.doi.org/10.1145/3205454.
Повний текст джерелаCvetkovski, Andrej. "An algorithm for approximate counting using limited memory resources." ACM SIGMETRICS Performance Evaluation Review 35, no. 1 (June 12, 2007): 181–90. http://dx.doi.org/10.1145/1269899.1254903.
Повний текст джерелаJones, J. A., and M. Mosca. "Approximate Quantum Counting on an NMR Ensemble Quantum Computer." Physical Review Letters 83, no. 5 (August 2, 1999): 1050–53. http://dx.doi.org/10.1103/physrevlett.83.1050.
Повний текст джерелаG. Groer, P. "Exact and Approximate Bayesian Estimation of Net Counting Rates." Radiation Protection Dosimetry 102, no. 3 (November 1, 2002): 265–68. http://dx.doi.org/10.1093/oxfordjournals.rpd.a006095.
Повний текст джерелаAtserias, Albert, and Neil Thapen. "The Ordering Principle in a Fragment of Approximate Counting." ACM Transactions on Computational Logic 15, no. 4 (August 2014): 1–11. http://dx.doi.org/10.1145/2629555.
Повний текст джерелаPandey, Prashant, Michael A. Bender, Rob Johnson, and Rob Patro. "Squeakr: an exact and approximate k-mer counting system." Bioinformatics 34, no. 4 (October 9, 2017): 568–75. http://dx.doi.org/10.1093/bioinformatics/btx636.
Повний текст джерелаZhou, Jinhong, Chao Wang, Xi Li, and Xuehai Zhou. "Fast approximate hash table using extended counting Bloom filter." International Journal of Computational Science and Engineering 11, no. 4 (2015): 380. http://dx.doi.org/10.1504/ijcse.2015.073497.
Повний текст джерелаYamakami, Tomoyuki. "Approximate counting for complex-weighted Boolean constraint satisfaction problems." Information and Computation 219 (October 2012): 17–38. http://dx.doi.org/10.1016/j.ic.2012.08.002.
Повний текст джерелаSinclair, Alistair, and Mark Jerrum. "Approximate counting, uniform generation and rapidly mixing Markov chains." Information and Computation 82, no. 1 (July 1989): 93–133. http://dx.doi.org/10.1016/0890-5401(89)90067-9.
Повний текст джерелаSu, Na, Zhe Hui Wu, Ji Min Liu, Tai An Liu, Xin Jun An, and Chang Qing Yan. "Mining Approximate Frequent Itemsets over Data Streams." Applied Mechanics and Materials 685 (October 2014): 536–39. http://dx.doi.org/10.4028/www.scientific.net/amm.685.536.
Повний текст джерелаObster, Dennis, and Naoki Sasakura. "Counting Tensor Rank Decompositions." Universe 7, no. 8 (August 15, 2021): 302. http://dx.doi.org/10.3390/universe7080302.
Повний текст джерелаDas, Mayukh, Devendra Singh Dhami, Gautam Kunapuli, Kristian Kersting, and Sriraam Natarajan. "Fast Relational Probabilistic Inference and Learning: Approximate Counting via Hypergraphs." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 7816–24. http://dx.doi.org/10.1609/aaai.v33i01.33017816.
Повний текст джерела