Zobrazeno 1 - 10
of 201
pro vyhledávání: '"Borassi, A."'
Autor:
Borassi, Michele, Epasto, Alessandro, Lattanzi, Silvio, Vassilvitskii, Sergei, Zadimoghaddam, Morteza
Publikováno v:
In Proceedings of the 34th Conference on Neural Information Processing Systems (NeurIPS 2020)
The sliding window model of computation captures scenarios in which data is arriving continuously, but only the latest $w$ elements should be used for analysis. The goal is to design algorithms that update the solution efficiently with each arrival r
Externí odkaz:
http://arxiv.org/abs/2006.05850
Autor:
Bergamini, Elisabetta, Borassi, Michele, Crescenzi, Pierluigi, Marino, Andrea, Meyerhenke, Henning
Given a connected graph $G=(V,E)$, the closeness centrality of a vertex $v$ is defined as $\frac{n-1}{\sum_{w \in V} d(v,w)}$. This measure is widely used in the analysis of real-world complex networks, and the problem of selecting the $k$ most centr
Externí odkaz:
http://arxiv.org/abs/1704.01077
Autor:
Javier Martínez Pacheco, Philippe Ranocha, Luciana Kasulin, Corina M. Fusari, Lucas Servi, Ariel. A. Aptekmann, Victoria Berdion Gabarain, Juan Manuel Peralta, Cecilia Borassi, Eliana Marzol, Diana Rosa Rodríguez-Garcia, Yossmayer del Carmen Rondón Guerrero, Mariana Carignani Sardoy, Lucía Ferrero, Javier F. Botto, Claudio Meneses, Federico Ariel, Alejandro D. Nadra, Ezequiel Petrillo, Christophe Dunand, José M. Estevez
Publikováno v:
Nature Communications, Vol 13, Iss 1, Pp 1-14 (2022)
Arabidopsis root hair growth is enhanced at low temperatures. Here the authors show that the class III peroxidases PRX62 and PRX69 modulate ROS homeostasis and cell wall characteristics, and promote root hair elongation at low temperature.
Externí odkaz:
https://doaj.org/article/d879dea23e2f4896b0ec2cf32f07d63d
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Borassi, Cecilia, Dorosz, Javier Gloazzo, Ricardi, Martiniano M., Sardoy, Mariana Carignani, Fachin, Laercio Pol, Marzol, Eliana, Mangano, Silvina, Garcia, Diana Rosa Rodríguez, Pacheco, Javier Martínez, del Carmen Rondón Guerrero, Yossmayer, Velasquez, Silvia M., Villavicencio, Bianca, Ciancia, Marina, Seifert, Georg, Verli, Hugo, Estevez, José M.
Publikováno v:
The New Phytologist, 2020 Aug 01. 227(3), 732-743.
Externí odkaz:
https://www.jstor.org/stable/26928371
Autor:
Borassi, Michele, Natale, Emanuele
We present KADABRA, a new algorithm to approximate betweenness centrality in directed and undirected graphs, which significantly outperforms all previous approaches on real-world complex networks. The efficiency of the new algorithm relies on two new
Externí odkaz:
http://arxiv.org/abs/1604.08553
In recent years, researchers proposed several algorithms that compute metric quantities of real-world complex networks, and that are very efficient in practice, although there is no worst-case guarantee. In this work, we propose an axiomatic framewor
Externí odkaz:
http://arxiv.org/abs/1604.01445
Autor:
Borassi, Michele
In this work, we consider the following problem: given a digraph $G=(V,E)$, for each vertex $v$, we want to compute the number of vertices reachable from $v$. In other words, we want to compute the out-degree of each vertex in the transitive closure
Externí odkaz:
http://arxiv.org/abs/1602.02129
Closeness is an important centrality measure widely used in the analysis of real-world complex networks. In particular, the problem of selecting the k most central nodes with respect to this measure has been deeply analyzed in the last decade. Howeve
Externí odkaz:
http://arxiv.org/abs/1507.01490
Publikováno v:
Phys. Rev. E 92, 032812 (2015)
We analyze the hyperbolicity of real-world networks, a geometric quantity that measures if a space is negatively curved. In our interpretation, a network with small hyperbolicity is "aristocratic", because it contains a small set of vertices involved
Externí odkaz:
http://arxiv.org/abs/1503.03061