Sciweavers

1022 search results - page 153 / 205
» New models and algorithms for programmable networks
Sort
View
123
Voted
UAI
2001
15 years 1 months ago
Expectation Propagation for approximate Bayesian inference
This paper presents a new deterministic approximation technique in Bayesian networks. This method, "Expectation Propagation," unifies two previous techniques: assumed-de...
Thomas P. Minka
108
Voted
AHSWN
2010
130views more  AHSWN 2010»
15 years 20 days ago
How Good is Opportunistic Routing? - A Reality Check under Rayleigh Fading Channels
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
Rong Zheng, Chengzhi Li
133
Voted
TKDE
2011
176views more  TKDE 2011»
14 years 7 months ago
Experience Transfer for the Configuration Tuning in Large-Scale Computing Systems
—This paper proposes a new strategy, the experience transfer, to facilitate the management of large-scale computing systems. It deals with the utilization of management experienc...
Haifeng Chen, Wenxuan Zhang, Guofei Jiang
SIGGRAPH
2000
ACM
15 years 4 months ago
The WarpEngine: an architecture for the post-polygonal age
We present the WarpEngine, an architecture designed for realtime image-based rendering of natural scenes from arbitrary viewpoints. The modeling primitives are real-world images w...
Voicu Popescu, John G. Eyles, Anselmo Lastra, Josh...
SIGCOMM
2009
ACM
15 years 7 months ago
Temporal distance metrics for social network analysis
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...