Zobrazeno 1 - 10
of 111
pro vyhledávání: '"Sebastiano Vigna"'
Autor:
Young-Ho Eom, Pablo Aragón, David Laniado, Andreas Kaltenbrunner, Sebastiano Vigna, Dima L Shepelyansky
Publikováno v:
PLoS ONE, Vol 10, Iss 3, p e0114825 (2015)
Wikipedia is a huge global repository of human knowledge that can be leveraged to investigate interwinements between cultures. With this aim, we apply methods of Markov chains and Google matrix for the analysis of the hyperlink networks of 24 Wikiped
Externí odkaz:
https://doaj.org/article/294b9335eafc4172b7c6b48f711f1954
Publikováno v:
Network Science. :1-23
Is it always beneficial to create a new relationship (have a new follower/friend) in a social network? This question can be formally stated as a property of the centrality measure that defines the importance of the actors of the network. Score monoto
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07fd0a1626bd022512b7afa2b6b813b6
https://doi.org/10.1017/nws.2022.42
https://doi.org/10.1017/nws.2022.42
Autor:
Guy L. Steele, Sebastiano Vigna
Publikováno v:
Proceedings of the ACM on Programming Languages. 5:1-31
In 2014, Steele, Lea, and Flood presented SplitMix, an object-oriented pseudorandom number generator (prng) that is quite fast (9 64-bit arithmetic/logical operations per 64 bits generated) and also splittable . A conventional prng object provides a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::224823cd4b6271ac699aaafa64bf6b42
https://doi.org/10.1145/3485525
https://doi.org/10.1145/3485525
Autor:
Sebastiano Vigna, Guy L. Steele
Publikováno v:
Software: Practice and Experience. 52:443-458
Congruential pseudorandom number generators rely on good multipliers, that is, integers that have good performance with respect to the spectral test. We provide lists of multipliers with a good lattice structure up to dimension eight and up to lag ei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1968d30122012c0c51ee3a5276d8837f
https://doi.org/10.1002/spe.3030
https://doi.org/10.1002/spe.3030
Autor:
David Blackman, Sebastiano Vigna
Publikováno v:
ACM Transactions on Mathematical Software. 47:1-32
F 2 -linear pseudorandom number generators are very popular due to their high speed, to the ease with which generators with a sizable state space can be created, and to their provable theoretical properties. However, they suffer from linear artifacts
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::276ed65ceb81362e6f07d067ded62c7c
https://doi.org/10.1145/3460772
https://doi.org/10.1145/3460772
Publikováno v:
Complex Networks & Their Applications X ISBN: 9783030934088
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f3ef86541243da7106d399244b46d22
https://doi.org/10.1007/978-3-030-93409-5_20
https://doi.org/10.1007/978-3-030-93409-5_20
Autor:
Sebastiano Vigna, Paolo Boldi
Publikováno v:
Network Science. 7:265-268
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2a4154cec534d706b441f728f72fc01
https://doi.org/10.1017/nws.2019.11
https://doi.org/10.1017/nws.2019.11
Autor:
David Blackman, Sebastiano Vigna
We describe a new statistical test for pseudorandom number generators (PRNGs). Our test can find bias induced by dependencies among the Hamming weights of the outputs of a PRNG, even for PRNGs that pass state-of-the-art tests of the same kind from th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8c6eea05843826f97eb13ba05003d68
Publikováno v:
ALENEX
A minimal perfect hash function bijectively maps a key set $S$ out of a universe $U$ into the first $|S|$ natural numbers. Minimal perfect hash functions are used, for example, to map irregularly-shaped keys, such as string, in a compact space so tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54868c75315ccb2f036e898718965362
https://doi.org/10.1137/1.9781611976007.14
https://doi.org/10.1137/1.9781611976007.14
Publikováno v:
IEEE 27th International Conference on Software Analysis, Evolution and Reengineering (SANER)
SANER
2020 IEEE 27th International Conference on Software Analysis, Evolution and Reengineering (SANER)
SANER
2020 IEEE 27th International Conference on Software Analysis, Evolution and Reengineering (SANER)
We consider the problem of mining the development history—as captured by modern version control systems—of ultra-large-scale software archives (e.g., tens of millions software repositories corresponding). We show that graph compression techniques
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1150117b3646ef7122b9123eb9e49df1