Sciweavers

406 search results - page 75 / 82
» Gadgets, Approximation, and Linear Programming
Sort
View
NIPS
2007
14 years 9 days ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 12 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
INFOCOM
2012
IEEE
12 years 1 months ago
On exploiting flow allocation with rate adaptation for green networking
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...
Jian Tang, Brendan Mumey, Yun Xing, Andy Johnson
HICSS
2007
IEEE
125views Biometrics» more  HICSS 2007»
14 years 5 months ago
Stochastic Model for Power Grid Dynamics
We introduce a stochastic model that describes the quasistatic dynamics of an electric transmission network under perturbations introduced by random load fluctuations, random rem...
Marian Anghel, Kenneth A. Werley, Adilson E. Motte...
VISUALIZATION
1997
IEEE
14 years 3 months ago
Simplifying polygonal models using successive mappings
: We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function f...
Jonathan D. Cohen, Dinesh Manocha, Marc Olano