Výsledky vyhledávání - "randomised approximation algorithm"

Identifying Global Icebergs in Distributed Streams

Autoři: Anceaume, Emmanuelle Busnel, Yann Rivetti, Nicolò a další

Přispěvatelé: Anceaume, Emmanuelle Busnel, Yann Rivetti, Nicolò a další

Zdroj: 2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS). :266-275

Témata: [INFO.INFO-DC]Computer Science [cs]/Distributed, oblivious adversary, Index Terms—data stream model, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], data stream model, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], randomised approximation al-gorithm, 02 engineering and technology, [INFO] Computer Science [cs], 16. Peace & justice, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], generalised coupon collector problem, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Internet, computer network security, distributed algorithms, telecommunication network routing, distributed Denial of Service attack, distributed algorithm, distributed streams, global iceberg attacks, guaranteed error bounds, routers, single-board computer cluster, Algorithm design and analysis, Analytical models, Approximation algorithms, Computational modeling, Computer crime, Monitoring, Servers, performance analysis, randomised approximation algorithm, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT]

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01194511/file/PID3812355.pdf
https://hal.science/hal-01141829v1

A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs: A randomised approximation algorithm for counting the number of forests in dense graphs

Autoři: J. D. Annan

Zdroj: Combinatorics, Probability and Computing. 3:273-283

Témata: dense graph, Combinatorial probability, Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, 0102 computer and information sciences, counting the number of forests, 15. Life on land, Enumeration in graph theory, randomised approximation algorithm, 01 natural sciences, Trees, randomised approximation scheme

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/690966
https://doi.org/10.1017/s0963548300001188
https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/randomised-approximation-algorithm-for-counting-the-number-of-forests-in-dense-graphs/E61A9E98F5191D737931284AE81DF047
https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S0963548300001188
https://dblp.uni-trier.de/db/journals/cpc/cpc3.html#Annan94