Sciweavers

2492 search results - page 288 / 499
» False-Name-Proofness in Social Networks
Sort
View
CSE
2009
IEEE
15 years 10 months ago
Equilibria and Efficiency Loss in Games on Networks
Social networks are the substrate upon which we make and evaluate many of our daily decisions: our costs and benefits depend on whether--or how many of, or which of--our friends ar...
Joshua R. Davis, Zachary Goldman, Jacob Hilty, Eli...
HICSS
2006
IEEE
174views Biometrics» more  HICSS 2006»
16 years 20 days ago
CrystalChat: Visualizing Personal Chat History
As more people take part in online conversations, awareness of the varying conversational styles and social mores afforded by different software is growing. However, this awarenes...
Annie Tat, M. Sheelagh T. Carpendale
CONCURRENCY
2008
99views more  CONCURRENCY 2008»
15 years 6 months ago
TRIBLER: a social-based peer-to-peer system
Most current P2P file sharing systems treat their users as anonymous, unrelated entities, and completely disregard any social relationships between them. However, social phenomena...
Johan A. Pouwelse, Pawel Garbacki, Jun Wang, Arno ...
BIOINFORMATICS
2007
83views more  BIOINFORMATICS 2007»
15 years 6 months ago
Exploring biological network structure using exponential random graph models
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
Zachary M. Saul, Vladimir Filkov
EPIA
2009
Springer
16 years 1 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...