Sciweavers

598 search results - page 53 / 120
» Approximation Algorithms for the Bottleneck Stretch Factor P...
Sort
View
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
14 years 1 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
MST
2007
167views more  MST 2007»
13 years 8 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
ATAL
2010
Springer
13 years 3 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
EMNLP
2010
13 years 6 months ago
Turbo Parsers: Dependency Parsing by Approximate Variational Inference
We present a unified view of two state-of-theart non-projective dependency parsers, both approximate: the loopy belief propagation parser of Smith and Eisner (2008) and the relaxe...
André F. T. Martins, Noah A. Smith, Eric P....
ECRTS
2009
IEEE
13 years 6 months ago
Approximate Bandwidth Allocation for Compositional Real-Time Systems
Allocation of bandwidth among components is a fundamental problem in compositional real-time systems. Stateof-the-art algorithms for bandwidth allocation use either exponential-ti...
Nathan Fisher, Farhana Dewan