Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Michele Borassi"'
Autor:
Pierluigi Crescenzi, Andrea Marino, Henning Meyerhenke, Michele Borassi, Elisabetta Bergamini
Publikováno v:
ACM Transactions on Knowledge Discovery from Data. 13:1-40
Given a connected graph G =( V , E ), where V denotes the set of nodes and E the set of edges of the graph, the length (that is, the number of edges) of the shortest path between two nodes v and w is denoted by d ( v , w ). The closeness centrality o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a99ebdf4d55e463a48768182398244b
https://doi.org/10.1145/3344719
https://doi.org/10.1145/3344719
Autor:
Sergei Vassilvitskii, Silvio Lattanzi, Alessandro Epasto, Michele Borassi, Morteza Zadimoghaddam
Publikováno v:
PODS
The streaming computation model is a standard model for large-scale data analysis: the input arrives one element at a time, and the goal is to maintain an approximately optimal solution using only a constant, or, at worst, polylogarithmic space.In pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8da95d0407112d3d4fc153db89ddffb1
https://doi.org/10.1145/3294052.3319701
https://doi.org/10.1145/3294052.3319701
Autor:
Michel Habib, Walter A. Kosters, Frank W. Takes, Andrea Marino, Pierluigi Crescenzi, Michele Borassi
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2015, 586, pp.59-80. ⟨10.1016/j.tcs.2015.02.033⟩
Theoretical Computer Science, 2015, 586, pp.59-80. ⟨10.1016/j.tcs.2015.02.033⟩
Theoretical Computer Science, Elsevier, 2015, 586, pp.59-80. ⟨10.1016/j.tcs.2015.02.033⟩
Theoretical Computer Science, 2015, 586, pp.59-80. ⟨10.1016/j.tcs.2015.02.033⟩
In this paper, we propose a new algorithm that computes the radius and the diameter of a weakly connected digraph G = ( V , E ) , by finding bounds through heuristics and improving them until they are validated. Although the worst-case running time i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::754f9c6035ec408e45be935b64591752
https://doi.org/10.1016/j.tcs.2015.02.033
https://doi.org/10.1016/j.tcs.2015.02.033
Autor:
Fabien Jourdan, Pierluigi Crescenzi, Christophe Junot, Andrea Marino, Michele Borassi, Etienne Birmelé, Marie-France Sagot, Ludovic Cottret, Leen Stougie, Vicente Acuña, Cecilia C. Klein, Vincent Lacroix, Alberto Marchetti-Spaccamela, Paulo Vieira Milreu
Publikováno v:
Bioinformatics
Bioinformatics, Oxford University Press (OUP), 2014, 30 (1), pp.61-70. ⟨10.1093/bioinformatics/btt597⟩
Bioinformatics, 2014, 30 (1), pp.61-70. ⟨10.1093/bioinformatics/btt597⟩
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
Vieira Milreu, P, Coimbra Klein, C, Cottret, L, Acuna, V, Birmele, E, Borassi, M, Junot, C, Marchetti-Spaccamela, A, Marino, A, Stougie, L, Jourdan, F, Crescenzi, P, Lacroix, V & Sagot, M-F 2014, ' Telling metabolic stories to explore metabolomics data--A case study on the Yeast response to cadmium exposure. ', Bioinformatics, vol. 30, no. 1, pp. 61-70 . https://doi.org/10.1093/bioinformatics/btt597
Bioinformatics, 30(1), 61-70. Oxford University Press
Bioinformatics, 30(1), 61-70
Bioinformatics 1 (30), 61-70. (2014)
Bioinformatics, Oxford University Press (OUP), 2014, 30 (1), pp.61-70. ⟨10.1093/bioinformatics/btt597⟩
Bioinformatics, 2014, 30 (1), pp.61-70. ⟨10.1093/bioinformatics/btt597⟩
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
Vieira Milreu, P, Coimbra Klein, C, Cottret, L, Acuna, V, Birmele, E, Borassi, M, Junot, C, Marchetti-Spaccamela, A, Marino, A, Stougie, L, Jourdan, F, Crescenzi, P, Lacroix, V & Sagot, M-F 2014, ' Telling metabolic stories to explore metabolomics data--A case study on the Yeast response to cadmium exposure. ', Bioinformatics, vol. 30, no. 1, pp. 61-70 . https://doi.org/10.1093/bioinformatics/btt597
Bioinformatics, 30(1), 61-70. Oxford University Press
Bioinformatics, 30(1), 61-70
Bioinformatics 1 (30), 61-70. (2014)
Motivation: The increasing availability of metabolomics data enables to better understand the metabolic processes involved in the immediate response of an organism to environmental changes and stress. The data usually come in the form of a list of me
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::02c0017e4353fe6e4f300d565879d5ef
https://doi.org/10.1093/bioinformatics/btt597
https://doi.org/10.1093/bioinformatics/btt597
Autor:
Michele Borassi, Emanuele Natale
Publikováno v:
24th Annual European Symposium on Algorithms (ESA 2016)
24th Annual European Symposium on Algorithms (ESA 2016), Aug 2016, Aarhus, Denmark. ⟨10.4230/LIPIcs.ESA.2016.20⟩
ACM Journal of Experimental Algorithmics
ACM Journal of Experimental Algorithmics, 2019, 24 (1), ⟨10.1145/3284359⟩
ACM Journal of Experimental Algorithmics, Association for Computing Machinery, 2019, 24 (1), ⟨10.1145/3284359⟩
24th Annual European Symposium on Algorithms
Leibniz International Proceedings in Informatics
24th Annual European Symposium on Algorithms (ESA 2016), Aug 2016, Aarhus, Denmark. ⟨10.4230/LIPIcs.ESA.2016.20⟩
ACM Journal of Experimental Algorithmics
ACM Journal of Experimental Algorithmics, 2019, 24 (1), ⟨10.1145/3284359⟩
ACM Journal of Experimental Algorithmics, Association for Computing Machinery, 2019, 24 (1), ⟨10.1145/3284359⟩
24th Annual European Symposium on Algorithms
Leibniz International Proceedings in Informatics
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::008c72d26aaf05a46e360bff52154970
http://arxiv.org/abs/1604.08553
http://arxiv.org/abs/1604.08553
Autor:
Michele Borassi
Assuming SETH, we cannot compute the number of reachable vertices in a digraph in O ( n 2 - ź ) .The same result holds if we restrict our attention to acyclic graphs.This result has consequences on the complexity of computing the transitive closure.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5656277999deb54f357e8020b3da8be6
http://arxiv.org/abs/1602.02129
http://arxiv.org/abs/1602.02129
Autor:
Elisabetta Bergamini, Pierluigi Crescenzi, Henning Meyerhenke, Andrea Marino, Michele Borassi
Publikováno v:
Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016
Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, 2016, Arlington, United States. ⟨10.1137/1.9781611974317.6⟩
ALENEX
Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, 2016, Arlington, United States. ⟨10.1137/1.9781611974317.6⟩
ALENEX
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c7b7ed143188542453e2f648d9098171
https://hal.inria.fr/hal-01390137
https://hal.inria.fr/hal-01390137
Publikováno v:
Electronic Notes in Theoretical Computer Science
Electronic Notes in Theoretical Computer Science, Elsevier, 2016, 322, pp.51-67. ⟨10.1016/j.entcs.2016.03.005⟩
Electronic Notes in Theoretical Computer Science, 2016, 322, pp.51-67. ⟨10.1016/j.entcs.2016.03.005⟩
Electronic Notes in Theoretical Computer Science, Elsevier, 2016, 322, pp.51-67. ⟨10.1016/j.entcs.2016.03.005⟩
Electronic Notes in Theoretical Computer Science, 2016, 322, pp.51-67. ⟨10.1016/j.entcs.2016.03.005⟩
International audience; We analyze several quadratic-time solvable problems, and we show that these problems are not solvable in truly subquadratic time (that is, in time O(n2−ϵ) for some ϵ>0), unless the well known Strong Exponential Time Hypoth
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::916c2d7a59cd619d7f0feea8bc9527ce
https://hal.inria.fr/hal-01390131/file/IntoTheSquare.pdf
https://hal.inria.fr/hal-01390131/file/IntoTheSquare.pdf
Publikováno v:
Physical Review E
Physical review. E, Statistical, nonlinear, and soft matter physics
92 (2015): 032812. doi:10.1103/PhysRevE.92.032812
info:cnr-pdr/source/autori:Michele Borassi (1); Alessandro Chessa (2); Guido Caldarelli (3)/titolo:Hyperbolicity measures democracy in real-world networks/doi:10.1103%2FPhysRevE.92.032812/rivista:Physical review. E, Statistical, nonlinear, and soft matter physics (Print)/anno:2015/pagina_da:032812/pagina_a:/intervallo_pagine:032812/volume:92
Physical review. E, Statistical, nonlinear, and soft matter physics
92 (2015): 032812. doi:10.1103/PhysRevE.92.032812
info:cnr-pdr/source/autori:Michele Borassi (1); Alessandro Chessa (2); Guido Caldarelli (3)/titolo:Hyperbolicity measures democracy in real-world networks/doi:10.1103%2FPhysRevE.92.032812/rivista:Physical review. E, Statistical, nonlinear, and soft matter physics (Print)/anno:2015/pagina_da:032812/pagina_a:/intervallo_pagine:032812/volume:92
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be5244eea33c3b71dedb60994b6c4966
Publikováno v:
Algorithms-ESA 2015 ISBN: 9783662483497
ESA
23rd Annual European Symposium on Algorithms (ESA)
23rd Annual European Symposium on Algorithms (ESA), Sep 2015, Patras, Greece. pp.215-226, ⟨10.1007/978-3-662-48350-3_19⟩
ESA
23rd Annual European Symposium on Algorithms (ESA)
23rd Annual European Symposium on Algorithms (ESA), Sep 2015, Patras, Greece. pp.215-226, ⟨10.1007/978-3-662-48350-3_19⟩
The (Gromov) hyperbolicity is a topological property of a graph, which has been recently applied in several different contexts, such as the design of routing schemes, network security, computational biology, the analysis of graph algorithms, and the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4fd6e53e395a76c84064a44596b887a8
https://doi.org/10.1007/978-3-662-48350-3_19
https://doi.org/10.1007/978-3-662-48350-3_19