Sciweavers

2092 search results - page 286 / 419
» A Theory of Non-Deterministic Networks
Sort
View
WWW
2006
ACM
16 years 14 days ago
Communities from seed sets
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
Reid Andersen, Kevin J. Lang
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 12 days ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
CHI
2006
ACM
16 years 6 days ago
Urbanhermes: social signaling with electronic fashion
Fashion signals are displayed to indicate access to information. Consistent, timely, and meaningful signal displays are only made possible if one is well-connected. While fashion ...
Christine M. Liu, Judith S. Donath
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
16 years 3 days ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
GROUP
2009
ACM
15 years 6 months ago
Grounding interpersonal privacy in mediated settings
Recent technologies supporting continuous connectivity enable sustained awareness within social networks, which eventually boosts interaction and therefore the need of individuals...
Natalia A. Romero, Panos Markopoulos