Sciweavers

3708 search results - page 37 / 742
» Approximating Betweenness Centrality
Sort
View
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 11 months ago
Reductions Between Expansion Problems
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
Prasad Raghavendra, David Steurer, Madhur Tulsiani
ICAI
2003
14 years 10 days ago
Benevolence, Trust and Autonomy
In this paper we will discuss tradeoffs between trust and autonomy. We show that benevolence play a central role in connecting these two social notions. We will show empirical resu...
Henry Hexmoor, Prapulla Poli
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 11 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
VC
2008
132views more  VC 2008»
13 years 10 months ago
Caustic spot light for rendering caustics
It is difficult to render caustic patterns at interactive frame rates. This paper introduces new rendering techniques that relax current constraints, allowing scenes with moving, n...
Xinguo Liu, Zhao Dong, Hujun Bao, Qunsheng Peng
DSN
2009
IEEE
14 years 5 months ago
Fluid modeling and control for server system performance and availability
Although server technology provides a means to support a wide range of online services and applications, their ad-hoc configuration poses significant challenges to the performan...
Luc Malrait, Sara Bouchenak, Nicolas Marchand