Sciweavers

267 search results - page 53 / 54
» On the approximability of influence in social networks
Sort
View
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
11 years 7 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
COCOA
2009
Springer
13 years 8 months ago
An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
Jingfa Liu, Yonglei Yao, Yu Zheng, Huantong Geng, ...
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 5 months ago
Understanding the Characteristics of Internet Short Video Sharing: YouTube as a Case Study
—Established in 2005, YouTube has become the most successful Internet site providing a new generation of short video sharing service. Today, YouTube alone comprises approximately...
Xu Cheng, Cameron Dale, Jiangchuan Liu
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
14 years 5 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
13 years 6 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh