Sciweavers

159 search results - page 5 / 32
» Small world models for social network algorithms testing
Sort
View
IEEEHPCS
2010
13 years 6 months ago
An experimental study of greedy routing algorithms
The “small world” phenomenon, i.e., the fact that the global social network is strongly connected in the sense that every two persons are inter-related through a small chain o...
Stavros Athanassopoulos, Christos Kaklamanis, Ilia...
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
13 years 11 months ago
Navigating Low-Dimensional and Hierarchical Population Networks
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...
Ravi Kumar, David Liben-Nowell, Andrew Tomkins
EDBT
2009
ACM
156views Database» more  EDBT 2009»
14 years 3 days ago
Evaluating very large datalog queries on social networks
We consider a near future scenario in which users of a Web 2.0 application, such as a social network, contribute to the application not only data, but also rules which automatical...
Royi Ronen, Oded Shmueli
CEEMAS
2007
Springer
13 years 11 months ago
Exploring Social Networks in Request for Proposal Dynamic Coalition Formation Problems
In farsighted MAS, every agent is aware of each other, and so they can evaluate the outcomes of their interaction in an efficient way. However, this farsighted knowledge becomes an...
Carlos Mérida-Campos, Steven Willmott
BMCBI
2010
183views more  BMCBI 2010»
13 years 7 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...