Algorithms and Models for the Web-Graph 5th International Workshop, WAW 2007, San Diego, CA, USA, December 11-12, 2007. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Bonato, Anthony (Επιμελητής έκδοσης), Chung, Fan R. K. (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.
Σειρά:Lecture Notes in Computer Science, 4863
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03136nam a22005775i 4500
001 978-3-540-77004-6
003 DE-He213
005 20151204172454.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540770046  |9 978-3-540-77004-6 
024 7 |a 10.1007/978-3-540-77004-6  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
072 7 |a UY  |2 bicssc 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a COM031000  |2 bisacsh 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Algorithms and Models for the Web-Graph  |h [electronic resource] :  |b 5th International Workshop, WAW 2007, San Diego, CA, USA, December 11-12, 2007. Proceedings /  |c edited by Anthony Bonato, Fan R. K. Chung. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2007. 
300 |a X, 217 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4863 
505 0 |a Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet -- Distribution of PageRank Mass Among Principle Components of the Web -- Finding a Dense-Core in Jellyfish Graphs -- A Geometric Preferential Attachment Model of Networks II -- Clustering Social Networks -- Manipulation-Resistant Reputations Using Hitting Time -- Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model -- A Spatial Web Graph Model with Local Influence Regions -- Determining Factors Behind the PageRank Log-Log Plot -- Approximating Betweenness Centrality -- Random Dot Product Graph Models for Social Networks -- Local Computation of PageRank Contributions -- Local Partitioning for Directed Graphs Using PageRank -- Stochastic Kronecker Graphs -- Deterministic Decentralized Search in Random Graphs -- Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms -- Parallelizing the Computation of PageRank -- Giant Component and Connectivity in Geographical Threshold Graphs. 
650 0 |a Computer science. 
650 0 |a Computer communication systems. 
650 0 |a Computers. 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Data mining. 
650 1 4 |a Computer Science. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Information Systems Applications (incl. Internet). 
650 2 4 |a Data Mining and Knowledge Discovery. 
650 2 4 |a Computer Communication Networks. 
700 1 |a Bonato, Anthony.  |e editor. 
700 1 |a Chung, Fan R. K.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540770039 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4863 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-77004-6  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)