Sciweavers

10901 search results - page 174 / 2181
» Approximations in Distributed Optimization
Sort
View
CCR
2006
117views more  CCR 2006»
15 years 6 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
16 years 6 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
ICASSP
2011
IEEE
14 years 10 months ago
Distributed beamforming for multiuser peer-to-peer and multi-group multicasting relay networks
We generalize the concept of multiuser peer-to-peer (MUP2P) relay networks to that of a multi-group multicasting (MGM) relay network where each source may broadcast its message to...
Nils Bornhorst, Marius Pesavento, Alex B. Gershman
CORR
2006
Springer
104views Education» more  CORR 2006»
15 years 6 months ago
Loop corrections for approximate inference
We propose a method to improve approximate inference methods by correcting for the influence of loops in the graphical model. The method is a generalization and alternative implem...
Joris M. Mooij, Bert Kappen
FORMATS
2007
Springer
16 years 20 days ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio