Zobrazeno 1 - 10
of 269
pro vyhledávání: '"Ziviani Artur"'
Embedding static graphs in low-dimensional vector spaces plays a key role in network analytics and inference, supporting applications like node classification, link prediction, and graph visualization. However, many real-world networks present dynami
Externí odkaz:
http://arxiv.org/abs/2101.01229
Network seeding for efficient information diffusion over time-varying graphs~(TVGs) is a challenging task with many real-world applications. There are several ways to model this spatio-temporal influence maximization problem, but the ultimate goal is
Externí odkaz:
http://arxiv.org/abs/2011.13518
As one of the main subjects of investigation in data science, network science has been demonstrated a wide range of applications to real-world networks analysis and modeling. For example, the pervasive presence of structural or topological characteri
Externí odkaz:
http://arxiv.org/abs/2009.12210
Network complexity, network information content analysis, and lossless compressibility of graph representations have been played an important role in network analysis and network modeling. As multidimensional networks, such as time-varying, multilaye
Externí odkaz:
http://arxiv.org/abs/2009.05879
Challenging the standard notion of totality in computable functions, one has that, given any sufficiently expressive formal axiomatic system, there are total functions that, although computable and "intuitively" understood as being total, cannot be p
Externí odkaz:
http://arxiv.org/abs/2009.01145
Extracting information from real-world large networks is a key challenge nowadays. For instance, computing a node centrality may become unfeasible depending on the intended centrality due to its computational cost. One solution is to develop fast met
Externí odkaz:
http://arxiv.org/abs/2006.16392
Autor:
Wehmuth, Klaus, Ziviani, Artur, Costa, Leonardo Chinelate, da Silva, Ana Paula Couto, Vieira, Alex Borges
In complex network analysis, centralities based on shortest paths, such as betweenness and closeness, are widely used. More recently, many complex systems are being represented by time-varying, multilayer, and time-varying multilayer networks, i.e. m
Externí odkaz:
http://arxiv.org/abs/2006.15401
Autor:
Souto, Yania Molina, Pereira, Rafael, Zorrilla, Rocío, Chaves, Anderson, Tsan, Brian, Rusu, Florin, Ogasawara, Eduardo, Ziviani, Artur, Porto, Fabio
In this paper, we present a cost-based approach for the automatic selection and allocation of a disjoint ensemble of black-box predictors to answer predictive spatio-temporal queries. Our approach is divided into two parts -- offline and online. Duri
Externí odkaz:
http://arxiv.org/abs/2005.11093
Publikováno v:
EURASIP Journal on Wireless Communications and Networking, Vol 2011, Iss 1, p 27 (2011)
Abstract We propose ZAP, an algorithm for the distributed channel assignment in cognitive radio (CR) networks. CRs are capable of identifying underutilized licensed bands of the spectrum, allowing their reuse by secondary users without interfering wi
Externí odkaz:
https://doaj.org/article/2f5cb7a7bec44b3d9d9b76ffff9eb92a
This work presents some outcomes of a theoretical investigation of incompressible high-order networks defined by a generalized graph representation. We study some of their network topological properties and how these may be related to real-world comp
Externí odkaz:
http://arxiv.org/abs/1905.05276