Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Shy-Min Chen"'
Publikováno v:
Online Information Review. 38:381-398
Purpose – Most studies on tie strength have focused on its definition, calculation and applications, but have not paid much attention to how tie strength can help analyse online social networks. Because ties play different roles in a network depend
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fcb3c12a61312705f8134eb9df032b60
https://doi.org/10.1108/oir-01-2013-0022
https://doi.org/10.1108/oir-01-2013-0022
Publikováno v:
Computer Networks. 56:198-212
Free riding is a common phenomenon in peer-to-peer (P2P) file sharing networks. Although several mechanisms have been proposed to handle free riding-mostly to exclude free riders, few of them have been adopted in a practical system. This may be attri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6fe44bddd587963345b7537eec1b30bb
https://doi.org/10.1016/j.comnet.2011.09.003
https://doi.org/10.1016/j.comnet.2011.09.003
Publikováno v:
AINA
Expert Seeking is a social network application that requires certain search strategies in the form of expert candidate-selection process. Assuming that no one in the network has the global knowledge, a query for expertise must be forwarded to, and be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b32d3302bc994542cd07acfde291a9cf
https://doi.org/10.1109/aina.2013.86
https://doi.org/10.1109/aina.2013.86
Publikováno v:
Euro-Par 2007 Parallel Processing ISBN: 9783540744658
Euro-Par
Euro-Par
Free riding is a common phenomenon in P2P networks. Although several mechanisms have been proposed to handle free riding-- mostly to exclude free riders, few of them have actually been adopted in practical systems. This may be attributed to the fact
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f2132411b54180b7b2a4a956bcfdd30
https://doi.org/10.1007/978-3-540-74466-5_56
https://doi.org/10.1007/978-3-540-74466-5_56
