Sciweavers

2492 search results - page 363 / 499
» False-Name-Proofness in Social Networks
Sort
View
IPM
2006
94views more  IPM 2006»
15 years 6 months ago
Binary Pathfinder: An improvement to the Pathfinder algorithm
The Pathfinder algorithm is widely used to prune social networks. The pruning maintains the geodesic distances between nodes. It has shown itself to be very useful in the analysis...
Vicente P. Guerrero Bote, Felipe Zapico-Alonso, Ma...
SOCIALCOM
2010
15 years 4 months ago
Structural Predictors of Tie Formation in Twitter: Transitivity and Mutuality
-- New ties are often formed between people who already have friends in common. Though the social sciences have addressed the effects of existing structural patterns on the formati...
Scott A. Golder, Sarita Yardi
IBMRD
2011
112views more  IBMRD 2011»
15 years 1 months ago
Sensor Andrew: Large-scale campus-wide sensing and actuation
—We present Sensor Andrew, a multi-disciplinary campus-wide scalable sensor network that is designed to host a wide range of sensor, actuator and low-power applications. The goal...
Anthony Rowe, Mario Berges, Gaurav Bhatia, Ethan G...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 9 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
WWW
2008
ACM
16 years 7 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan