Sciweavers

3017 search results - page 407 / 604
» On compressing 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...
NOTERE
2010
15 years 5 months ago
Managing group membership in ad hoc m-commerce trading systems
Abstract—Managing group membership in an ad hoc mcommerce trading forum is a challenging task as peers may only have partial knowledge of the current membership due to frequent n...
Husna Osman, Hamish Taylor
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
ICC
2009
IEEE
176views Communications» more  ICC 2009»
16 years 1 months ago
Error Resilient Non-Asymmetric Slepian-Wolf Coding
Abstract—We consider non-asymmetric distributed source coding (DSC) that achieves any point in the Slepian-Wolf (SW) region. We study the error propagation phenomena and propose ...
Cédric Herzet, Velotiaray Toto-Zarasoa, Ali...
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
15 years 6 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...