Sciweavers

23988 search results - page 621 / 4798
» Social Network Computing
Sort
View
INFOCOM
2006
IEEE
16 years 1 months ago
Bottleneck Routing Games in Communication Networks
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
Ron Banner, Ariel Orda
JSAC
2008
111views more  JSAC 2008»
15 years 7 months ago
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
Abstract--Applications involving the dissemination of information directly relevant to humans (e.g., service advertising, news spreading, environmental alerts) often rely on publis...
Paolo Costa, Cecilia Mascolo, Mirco Musolesi, Gian...
ICDM
2010
IEEE
212views Data Mining» more  ICDM 2010»
15 years 5 months ago
Modeling Information Diffusion in Implicit Networks
Social media forms a central domain for the production and dissemination of real-time information. Even though such flows of information have traditionally been thought of as diffu...
Jaewon Yang, Jure Leskovec
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
TouchTone: Interactive Local Image Adjustment Using Point-and-Swipe
Recent proliferation of camera phones, photo sharing and social network services has significantly changed how we process our photos. Instead of going through the traditional dow...
Chia-Kai Liang, Wei-Chao Chen, Natasha Gelfand
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 5 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna