Sciweavers

7150 search results - page 188 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
JCSS
2010
146views more  JCSS 2010»
15 years 5 months ago
Connected facility location via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
CDC
2008
IEEE
206views Control Systems» more  CDC 2008»
16 years 29 days ago
Approximate dynamic programming using support vector regression
— This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architect...
Brett Bethke, Jonathan P. How, Asuman E. Ozdaglar
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
15 years 10 months ago
Approximate Medians and other Quantiles in One Pass and with Limited Memory
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G....
ICML
2009
IEEE
16 years 1 months ago
Split variational inference
We propose a deterministic method to evaluate the integral of a positive function based on soft-binning functions that smoothly cut the integral into smaller integrals that are ea...
Guillaume Bouchard, Onno Zoeter
SAT
2007
Springer
99views Hardware» more  SAT 2007»
16 years 18 days ago
Horn Upper Bounds and Renaming
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
Marina Langlois, Robert H. Sloan, György Tur&...