Sciweavers

7150 search results - page 230 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
16 years 6 months 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
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
16 years 21 days ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
ISCAS
1999
IEEE
106views Hardware» more  ISCAS 1999»
15 years 11 months ago
Adaptive minimax filtering via recursive optimal quadratic approximations
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
S. Gollamudi, Yih-Fang Huang
ASPDAC
2005
ACM
107views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Making fast buffer insertion even faster via approximation techniques
Abstract— As technology scales to 0.13 micron and below, designs are requiring buffers to be inserted on interconnects of even moderate length for both critical paths and fixing...
Zhuo Li, Cliff C. N. Sze, Charles J. Alpert, Jiang...
UAI
2003
15 years 8 months ago
Approximate Inference and Constrained Optimization
Loopy and generalized belief propagation are popular algorithms for approximate inference in Markov random fields and Bayesian networks. Fixed points of these algorithms correspo...
Tom Heskes, Kees Albers, Bert Kappen