Регистрация | Вход в службу | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

henningpeters library [96 articles]

Статьи, недавно добавленные в библиотеку henningpeters .
  • SybilGuard: defending against sybil attacks via social networks
    (2006), pp. 267-278.
    by Haifeng Yu, Michael Kaminsky, Phillip B Gibbons, Abraham Flaxman
  • Probabilistic routing in intermittently connected networks
    SIGMOBILE Mob. Comput. Commun. Rev., Vol. 7, No. 3. (July 2003), pp. 19-20.
    by Anders Lindgren, Avri Doria, Olov Schel&\#233;n
  • Spectral Graph Theory
    by Fan RK Chung
    posted to graph-theory by henningpeters on 2006-06-14 07:01:31 as ****
  • Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
    Lecture Notes in Computer Science, Vol. 2218 (2001), pp. 329-??.
    by Antony Rowstron, Peter Druschel
  • A Scalable Content Addressable Network
    No. TR-00-010. (2000)
    by Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker
  • Increasing the Readability of Graph Drawings with Centrality-Based Scaling
    (2 February 2006)
    by Damian Merrick, Joachim Gudmundsson
    posted to 2006 algorithm graph social visualization by henningpeters on 2006-06-13 21:07:44 as read
  • Identity and Search in Social Networks
    (17 May 2002)
    by DJ Watts, PS Dodds, MEJ Newman
  • How to search a social network
    (3 November 2004)
    by Lada A Adamic, Eytan Adar
  • A lightweight, robust P2P system to handle flash crowds
    SIGCOMM Comput. Commun. Rev., Vol. 32, No. 3. (July 2002), pp. 17-17.
    by Angelos Stavrou, Dan Rubenstein, Sambit Sahu
    posted to 2002 clustering p2p performance by henningpeters on 2006-06-03 22:45:03 as ** along with 1 person dsteinbock
  • Clustering Hosts in P2P and Global Computing Platforms
    by Abhishek Agrawal, Henri Casanova
    posted to 2003 clustering p2p by henningpeters on 2006-06-03 22:42:03 as ***
  • Sloppy hashing and self-organizing clusters
    (2003)
    by M Freedman, D Eres
  • Partitioning sparse matrices with eigenvectors of graphs
    SIAM J. Matrix Anal. Appl., Vol. 11, No. 3. (July 1990), pp. 430-452.
    by Alex Pothen, Horst D Simon, Kan-Pu Liou
  • Reducing the bandwidth of sparse symmetric matrices
    (1969), pp. 157-172.
    by E Cuthill, J Mckee
    posted to 1969 clustering graph-theory by henningpeters on 2006-05-28 19:36:03 as ***
  • Modeling the Dynamics of Social Networks
    (24 May 2006)
    by Victor V Kryssanov, Frank J Rinaldo, Evgeny L Kuleshov, Hitoshi Ogawa
  • Dynamic graph algorithms
    (1997)
  • A DoS-limiting network architecture
    Vol. 35, No. 4. (October 2005), pp. 241-252.
    by Xiaowei Yang, David Wetherall, Thomas Anderson
  • Resilient Overlay Networks
    (2001), pp. 131-145.
    by David G Andersen, Hari Balakrishnan, Frans M Kaashoek, Robert Morris
  • Internet indirection infrastructure
    IEEE/ACM Trans. Netw., Vol. 12, No. 2. (April 2004), pp. 205-218.
    by Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana
  • Plethora: A Locality Enhancing Peer-to-Peer Network
    (2004)
    by Ronaldo A Ferreira, Suresh Jagannathan, Ananth Grama
    posted to 2004 dht tapestry by henningpeters on 2006-05-18 00:16:31 as *
  • Cluster Analysis using Triangulation
    (1997)
    posted to 1997 clustering by henningpeters on 2006-05-15 05:02:59 as **** along with 1 person MoritzSteiner
  • Computing communities in large networks using random walks
    ArXiv Condensed Matter e-prints (2004)
    by M Latapy, P Pons
    posted to clustering networks by henningpeters on 2006-05-15 04:51:28 as read along with 1 person MoritzSteiner
  • Highways: Proximity Clustering for Scalable Peer-to-Peer Network
    (2004), pp. 266-267.
    by Eng K Lua, Jon Crowcroft, Marcelo Pias
    posted to 2004 clustering networks p2p by henningpeters on 2006-05-15 04:26:53 as read along with 1 person MoritzSteiner
  • On Data Clustering Analysis: Scalability, Constraints, and Validation
    (2002), pp. 28-39.
    by Osmar R Zaiane, Andrew Foss, Chi H Lee, Weinan Wang
    posted to 2002 clustering by henningpeters on 2006-05-15 04:03:17 as read along with 1 person MoritzSteiner
  • DDC: A Dynamic and Distributed Clustering Algorithm for Networked Virtual Environments based on P2P Networks
    (2005)
    by Moritz Steiner, Ernst W Biersack
  • A method for decentralized clustering in large multi-agent systems
    (2003), pp. 789-796.
    by Elth Ogston, Benno Overeinder, Maarten van Steen, Frances Brazier
    posted to 2003 clustering distributed-algorithm networks by henningpeters on 2006-05-12 20:46:01 as read
  • Automatic decentralized clustering for wireless sensor networks
    EURASIP J. Wirel. Commun. Netw., Vol. 5, No. 5. (October 2005), pp. 686-697.
    by Chih-Yu Wen, William A Sethares
    posted to 2005 clustering distributed-algorithm networks by henningpeters on 2006-05-12 20:44:30 as ***
  • R-MAT: A Recursive Model for Graph Mining
    (April 2004)
    by Deepayan Chakrabarti, Yiping Zhan, Christos Faloutsos
  • Building Low-Diameter P2P Networks
    IEEE Journal on Selected Areas in Communications, Vol. 21, No. 6. (August 2003), pp. 905-1002.
    posted to 2003 networks overlay p2p by henningpeters on 2006-05-09 19:54:38 as * along with 1 person lrodero
  • SkipNet: A Scalable Overlay Network with Practical Locality Properties
    (March 2003)
    by Nicholas JA Harvey, Michael B Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman
    posted to 2003 dht networks p2p tapestry by henningpeters on 2006-05-09 19:30:54 as ** along with 1 person lrodero
  • Finding Communities in Linear Time: A Physics Approach
    (26 Oct 2003)
    by Fang Wu, Bernardo A Huberman
  • Fast algorithm for detecting community structure in networks
    (22 September 2003)
    by MEJ Newman
  • Detecting Network Communities: a new systematic and efficient algorithm
    (25 October 2004)
    by Luca Donetti, Miguel A Munoz
  • Detecting communities in large networks
    (20 February 2004)
    by Andrea Capocci, Vito D Servedio, Guido Caldarelli, Francesca Colaiori
  • Efficient Algorithms for Sampling and Clustering of Large Nonuniform Networks
    (2 June 2004)
    by Pekka Orponen, Satu E Schaeffer
  • Extracting reputation in multi agent systems by means of social network topology
    (2002), pp. 467-474.
    by Josep M Pujol, Ramon Sangüesa, Jordi Delgado
  • Enhancing reputation mechanisms via online social networks
    (2004), pp. 236-237.
    by Tad Hogg, Lada Adamic
  • A decentralized algorithm for spectral analysis
    (2004), pp. 561-568.
    by David Kempe, Frank Mcsherry
  • Decentralized Search in Networks Using Homophily and Degree Disparity
    (2005)
    by Ozgur Simsek, David Jensen
  • Impeding Attrition Attacks in P2P Systems
    (2004)
    by Petros Maniatis, TJ Giuli, Mema Roussopoulos, David SH Rosenthal, Mary Baker
    posted to 2004 attrition security by henningpeters on 2006-05-07 20:12:29 as **
  • A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks
    (2000), pp. 511-521.
    by Mainak Chatterjee, Sajal K Das, Damla Turgut
    posted to 2000 clustering distributed-algorithm networks by henningpeters on 2006-05-07 19:55:59 as ***
  • notes Group Spreading: A Protocol for Provably Secure Distributed Name Service.
    (2004), pp. 183-195.
    by Baruch Awerbuch, Christian Scheideler
    posted to 2004 decentralized security by henningpeters on 2006-05-06 07:57:32 as read
  • Architectural Considerations for a Self-Configuring Routing Scheme for Spontaneous Networks
    (26 Oct 2005)
    by José I Alvarez-Hamelin, Aline C Viana, Marcelo D De Amorim
    posted to 2005 dht networks resilience routing by henningpeters on 2006-05-06 07:14:20 as ***
  • Statistical mechanics of complex networks
    Reviews of Modern Physics, Vol. 74 (30 January 2002)
    by Reka Albert, Albert-Laszlo Barabasi
  • Discovering parametric clusters in social small-world graphs
    (2005), pp. 1231-1238.
    by Jonathan Mcpherson, Kwan-Liu Ma, Michael Ogawa
    posted to 2005 graph-theory social by henningpeters on 2006-05-06 06:57:19 as read along with 1 person ankur_iitg
  • On Identifying Strongly Connected Components in Parallel
    (2000), pp. 505-511.
    by Lisa Fleischer, Bruce Hendrickson, Ali Pinar
    posted to 2000 graph-theory by henningpeters on 2006-05-06 06:55:10 as ***
  • Defending the Sybil Attack in P2P Networks: Taxonomy, Challenges, and a Proposal for Self-Registration
    (April 2006)
    by Jochen Dinger, Hannes Hartenstein
  • Limiting Sybil Attacks in Structured Peer-to-Peer Networks
    No. NAS-TR-0017-2005. (2005)
    by Hosam Rowaihy, William Enck, Patrick Mcdaniel, Thomas La-Porta
  • Defending against Eclipse attacks on overlay networks
    (September 2004)
    by Atul Singh, Miguel Castro, Antony Rowstron, Peter Druschel
  • Managing P2P security
    Commun. ACM, Vol. 47, No. 9. (September 2004), pp. 95-98.
    by Jason E Bailes, Gary F Templeton
  • Kelips: Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead
    (2003)
    by Indranil Gupta, Ken Birman, Prakash Linga, Al Demers, Robbert van Renesse
    posted to 2003 dht kelips p2p resilience by henningpeters on 2006-04-28 18:00:24 as ***
  • Вы можете ссылаться на эту страницу по адресу: http://www.citeulike.org/user/henningpeters

    Result page: 1 2 Next RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.