Sciweavers

2678 search results - page 324 / 536
» Voting in social networks
Sort
View
ICS
2010
Tsinghua U.
14 years 8 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
ATAL
2009
Springer
14 years 5 months ago
Using relational concept knowledge to improve search in referral networks
The notion of referral networks, as presented in the work of Singh and Yolum, and their application to knowledge management, lacks two fundamental aspects; the relation of concept...
Tony White, Shawn McQuaker, Amirali Salehi-Abari
ASUNAM
2010
IEEE
13 years 9 months ago
A Multiobjective and Evolutionary Clustering Method for Dynamic Networks
—The discovery of evolving communities in dynamic networks is an important research topic that poses challenging tasks. Previous evolutionary based clustering methods try to maxi...
Francesco Folino, Clara Pizzuti
IJNVO
2011
47views more  IJNVO 2011»
13 years 5 months ago
Harvesting covert networks: a case study of the iMiner database
: Data collection of covert networks is an inherently difficult task because of the very nature of these networks. Researchers find it difficult to locate and access data relating ...
Nasrullah Memon, Uffe Kock Wiil, Reda Alhajj, Clau...
INFOCOM
2011
IEEE
13 years 2 months ago
User-centric data dissemination in disruption tolerant networks
Abstract—Data dissemination is useful for many applications of Disruption Tolerant Networks (DTNs). Current data dissemination schemes are generally network-centric ignoring user...
Wei Gao, Guohong Cao