Algorithms and Models for the Web Graph [[electronic resource] ] : 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings / / edited by Anthony Bonato, Michael Mitzenmacher, Pawel Pralat
| Algorithms and Models for the Web Graph [[electronic resource] ] : 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings / / edited by Anthony Bonato, Michael Mitzenmacher, Pawel Pralat |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (X, 233 p. 40 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Data mining Information storage and retrieval systems Discrete Mathematics in Computer Science Data Mining and Knowledge Discovery Information Storage and Retrieval |
| ISBN | 3-319-03536-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model -- A Spatial Preferential Attachment Model with Local Clustering -- A Local Clustering Algorithm for Connection -- On the Power of Adversarial Infections in Networks -- On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods -- A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks -- Evolution of the Media Web -- Random Intersection Graph Process -- Alpha Current Flow Betweenness Centrality -- Tree Nash Equilibria in the Network Creation Game -- Fast Low-Cost Estimation of Network Properties Using Random Walks -- An Lp Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model -- Fast Algorithms for the Maximum Clique Problem on Massive Sparse -- A Faster Algorithm to Update Betweenness Centrality after Node Alteration -- Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient -- Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank -- Anarchy Is Free in Network Creation. |
| Record Nr. | UNISA-996465277003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Models for the Web Graph : 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings / / edited by Anthony Bonato, Michael Mitzenmacher, Pawel Pralat
| Algorithms and Models for the Web Graph : 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings / / edited by Anthony Bonato, Michael Mitzenmacher, Pawel Pralat |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (X, 233 p. 40 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Data mining Information storage and retrieval systems Discrete Mathematics in Computer Science Data Mining and Knowledge Discovery Information Storage and Retrieval |
| ISBN | 3-319-03536-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model -- A Spatial Preferential Attachment Model with Local Clustering -- A Local Clustering Algorithm for Connection -- On the Power of Adversarial Infections in Networks -- On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods -- A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks -- Evolution of the Media Web -- Random Intersection Graph Process -- Alpha Current Flow Betweenness Centrality -- Tree Nash Equilibria in the Network Creation Game -- Fast Low-Cost Estimation of Network Properties Using Random Walks -- An Lp Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model -- Fast Algorithms for the Maximum Clique Problem on Massive Sparse -- A Faster Algorithm to Update Betweenness Centrality after Node Alteration -- Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient -- Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank -- Anarchy Is Free in Network Creation. |
| Record Nr. | UNINA-9910484617503321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the 41st Annual Acm Symposium on Theory of Computing
| Proceedings of the 41st Annual Acm Symposium on Theory of Computing |
| Autore | Mitzenmacher Michael |
| Pubbl/distr/stampa | [Place of publication not identified], : Association for Computing Machinery, 2009 |
| Descrizione fisica | 1 online resource (750 p.;) |
| Collana | ACM Conferences |
| Soggetto topico | Information Technology - Computer Science (Hardware & Networks) |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | STOC '09 |
| Record Nr. | UNINA-9910375799403321 |
Mitzenmacher Michael
|
||
| [Place of publication not identified], : Association for Computing Machinery, 2009 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||