標題: Titlebook: Algorithms and Models for the Web Graph; 11th International W Anthony Bonato,Fan Chung Graham,Pawe? Pra?at Conference proceedings 2014 Spri [打印本頁] 作者: implicate 時間: 2025-3-21 17:18
書目名稱Algorithms and Models for the Web Graph影響因子(影響力)
書目名稱Algorithms and Models for the Web Graph影響因子(影響力)學科排名
書目名稱Algorithms and Models for the Web Graph網(wǎng)絡(luò)公開度
書目名稱Algorithms and Models for the Web Graph網(wǎng)絡(luò)公開度學科排名
書目名稱Algorithms and Models for the Web Graph被引頻次
書目名稱Algorithms and Models for the Web Graph被引頻次學科排名
書目名稱Algorithms and Models for the Web Graph年度引用
書目名稱Algorithms and Models for the Web Graph年度引用學科排名
書目名稱Algorithms and Models for the Web Graph讀者反饋
書目名稱Algorithms and Models for the Web Graph讀者反饋學科排名
作者: BURSA 時間: 2025-3-21 21:16 作者: 死亡 時間: 2025-3-22 00:43
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153177.jpg作者: LUCY 時間: 2025-3-22 06:27 作者: 財政 時間: 2025-3-22 10:14 作者: Priapism 時間: 2025-3-22 13:57
Grundzüge station?rer Rückfallarbeitzed PageRank with node-dependent restart. The first generalization is based on the proportion of visits to nodes before the restart, whereas the second generalization is based on the proportion of time a node is visited just before the restart. In the original case of constant restart probability, t作者: 懶惰民族 時間: 2025-3-22 20:02 作者: disparage 時間: 2025-3-23 00:47
Grundzüge station?rer Rückfallarbeitistribution with an infinite variance, since such degree distribution is usually observed in real-world networks of diverse nature..There are two common definitions of the clustering coefficient of a graph: global clustering and average local clustering. It is widely believed that in real networks b作者: 鈍劍 時間: 2025-3-23 02:16
https://doi.org/10.1007/978-3-658-33192-4 subgraph problem. We present a primal-dual algorithm that provides a . approximation and takes .. iterations, each iteration having a shuffle size of . and a reducer size of .. Here . is the number of edges, . is the number of vertices, and . is the maximum degree of a node. This dominates the prev作者: SPER 時間: 2025-3-23 08:52 作者: 跳動 時間: 2025-3-23 11:07 作者: Carcinoma 時間: 2025-3-23 13:55 作者: Nibble 時間: 2025-3-23 18:03
https://doi.org/10.1007/978-3-658-33192-4randomly chosen node can be closely approximated by the PageRank of the root node of an appropriately constructed tree. This tree approximation is in turn related to the solution of a linear stochastic fixed-point equation that has been thoroughly studied in the recent literature.作者: ABOUT 時間: 2025-3-24 01:28 作者: 消息靈通 時間: 2025-3-24 03:09 作者: discord 時間: 2025-3-24 07:02 作者: 即席 時間: 2025-3-24 11:06
978-3-319-13122-1Springer International Publishing Switzerland 2014作者: magenta 時間: 2025-3-24 18:52 作者: Trochlea 時間: 2025-3-24 19:35
https://doi.org/10.1007/978-3-658-33192-4randomly chosen node can be closely approximated by the PageRank of the root node of an appropriately constructed tree. This tree approximation is in turn related to the solution of a linear stochastic fixed-point equation that has been thoroughly studied in the recent literature.作者: 輕率的你 時間: 2025-3-25 01:08 作者: ABIDE 時間: 2025-3-25 04:29
https://doi.org/10.1007/978-3-658-33192-4atic setting where the LiveRank is computed before any query is made, to dynamic settings where the LiveRank can be updated as queries are processed. Our results show that building on the PageRank can lead to efficient LiveRanks for Web graphs.作者: 生氣地 時間: 2025-3-25 08:13
Modelling of Trends in Twitter Using Retweet Graph Dynamics,the influence of the model parameters on the basic characteristics of the retweet graph, such as the density of edges and the size and density of the LCC. Finally, we put the model in practice, estimate its parameters and compare the resulting behavior of the model to our datasets.作者: 胰臟 時間: 2025-3-25 12:54 作者: Fallibility 時間: 2025-3-25 17:59
0302-9743 ng on graph-theoretic and algorithmic aspects of related complex networks, including social networks, citation networks, biological networks, molecular networks, and other networks arising from the Internet.978-3-319-13122-1978-3-319-13123-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 詞根詞綴法 時間: 2025-3-25 21:45
Grundzüge station?rer Rückfallarbeitd with a constant global clustering..In this paper we prove that if the degree distribution obeys the power law with an infinite variance, then the global clustering coefficient tends to zero with high probability as the size of a graph grows.作者: 外觀 時間: 2025-3-26 00:07 作者: gospel 時間: 2025-3-26 06:36 作者: Ptsd429 時間: 2025-3-26 11:38
Efficient Primal-Dual Graph Algorithms for MapReduce,lying polytope so that the number of iterations becomes small, but an approximate primal solution can still be recovered from the approximate dual solution. We then show an application of the same technique to the fractional maximum matching problem in bipartite graphs. Our results also map naturally to the PRAM model.作者: PALMY 時間: 2025-3-26 12:39
Conference proceedings 2014g, China, in December 2014. .The 12 papers presented were carefully reviewed and selected for inclusion in this volume. The aim of the workshop was to further the understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of high-performance作者: fatuity 時間: 2025-3-26 20:44
Clustering and the Hyperbolic Geometry of Complex Networks,s, implementing the assumption that hyperbolic geometry underlies the structure of these networks. We do a rigorous analysis of clustering and characterize the global clustering coefficient in terms of the parameters of the model. We show how the global clustering coefficient can be tuned by these parameters, giving an explicit formula.作者: APEX 時間: 2025-3-27 00:37
Personalized PageRank with Node-Dependent Restart,he two measures coincide. We discuss interesting particular cases of restart probabilities and restart distributions. We show that both generalizations of Personalized PageRank have an elegant expression connecting the so-called direct and reverse Personalized PageRanks that yield a symmetry property of these Personalized PageRanks.作者: Aspirin 時間: 2025-3-27 04:47
Conference proceedings 2014 algorithms and applications that exploit these graphs. The workshop gathered the researchers who are working on graph-theoretic and algorithmic aspects of related complex networks, including social networks, citation networks, biological networks, molecular networks, and other networks arising from the Internet.作者: Finasteride 時間: 2025-3-27 06:49 作者: Functional 時間: 2025-3-27 13:01
Grundzüge station?rer Rückfallarbeithe two measures coincide. We discuss interesting particular cases of restart probabilities and restart distributions. We show that both generalizations of Personalized PageRank have an elegant expression connecting the so-called direct and reverse Personalized PageRanks that yield a symmetry property of these Personalized PageRanks.作者: 煩人 時間: 2025-3-27 17:01 作者: Enervate 時間: 2025-3-27 18:55 作者: 截斷 時間: 2025-3-27 21:57 作者: 建筑師 時間: 2025-3-28 03:26
https://doi.org/10.1007/978-3-658-33192-4develop an efficient Monte Carlo EM algorithm for learning the parameters. Empirical results show that our model outperforms other state-of-the-art ones, and can give better understanding of the documents.作者: fructose 時間: 2025-3-28 06:26 作者: 山間窄路 時間: 2025-3-28 12:41 作者: ACE-inhibitor 時間: 2025-3-28 15:50 作者: Mercurial 時間: 2025-3-28 19:49 作者: tympanometry 時間: 2025-3-29 01:56
Burning a Graph as a Model of Social Contagion,earching paradigms such as Firefighter. The burning number measures the speed of the spread of contagion in a graph; the lower the burning number, the faster the contagion spreads. We provide a number of properties of the burning number, including characterizations and bounds. The burning number is 作者: Grievance 時間: 2025-3-29 07:03 作者: Hallowed 時間: 2025-3-29 08:58
Efficient Computation of the Weighted Clustering Coefficient,as been widely adopted for assessing the quality of nodes in a social network. The computation of the clustering coefficient is challenging since it requires to count the number of triangles in the graph. Several recent works proposed efficient sampling, streaming and MapReduce algorithms that allow作者: BATE 時間: 2025-3-29 14:32 作者: 下船 時間: 2025-3-29 16:32
Efficient Primal-Dual Graph Algorithms for MapReduce, subgraph problem. We present a primal-dual algorithm that provides a . approximation and takes .. iterations, each iteration having a shuffle size of . and a reducer size of .. Here . is the number of edges, . is the number of vertices, and . is the maximum degree of a node. This dominates the prev作者: Exposition 時間: 2025-3-29 20:04 作者: intuition 時間: 2025-3-30 02:26
Relational Topic Factorization for Link Prediction in Document Networks,s are text documents. We propose the relational topic factorization model (RTF), a model that combines topic models and matrix factorization. We also develop an efficient Monte Carlo EM algorithm for learning the parameters. Empirical results show that our model outperforms other state-of-the-art on作者: 要素 時間: 2025-3-30 05:26
Firefighting as a Game,each from real fires to the spreading of diseases and the containment of floods. Furthermore, it can be used to model the spread of computer viruses or viral marketing in communication networks..In this work, we study the problem from a game-theoretical perspective. Such a context seems very appropr作者: Baffle 時間: 2025-3-30 11:49
PageRank in Scale-Free Random Graphs,randomly chosen node can be closely approximated by the PageRank of the root node of an appropriately constructed tree. This tree approximation is in turn related to the solution of a linear stochastic fixed-point equation that has been thoroughly studied in the recent literature.作者: 滲入 時間: 2025-3-30 14:28
Modelling of Trends in Twitter Using Retweet Graph Dynamics,of several different events. In particular, for these datasets, we construct and investigate the retweet graphs. We find that the retweet graph for a trending topic has a relatively dense largest connected component (LCC). Next, based on the insights obtained from the analyses of the datasets, we de作者: TOXIC 時間: 2025-3-30 17:18
LiveRank: How to Refresh Old Crawls,nt to identify a significant fraction of these pages that still exist at present time. Liveness of an old page can be tested through an online query at present time. We call LiveRank a ranking of the old pages that tries to give good rankings to active nodes. The quality of a LiveRank is measured by
