AI
2005
Springer
14 years 11 hour ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
SIAMJO
2008
14 years 17 hour ago
2008
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
SIAMCOMP
2008
14 years 17 hour ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
JMLR
2006
2006
Geometric Variance Reduction in Markov Chains: Application to Value Function and Gradient Estimation
14 years 1 days ago
We study a sequential variance reduction technique for Monte Carlo estimation of functionals in Markov Chains. The method is based on designing sequential control variates using s...
JMLR
2006
14 years 1 days ago
2006
We introduce a method for approximate smoothed inference in a class of switching linear dynamical systems, based on a novel form of Gaussian Sum smoother. This class includes the ...
ECCC
2007
14 years 1 days ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
JC
2006
14 years 2 days ago
2006
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
CORR
2007
Springer
14 years 2 days ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
IPL
2006
14 years 2 days ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
JDA
2008
14 years 2 days ago
2008
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...