Results 1  10
of
26,161
Efficient Approximation of . . .
, 2002
"... This article presents efficient equity approximations for backgammon races based on statistical analyses. In conjunction with a 1ply search the constructed evaluation functions allow a program to play short races almost perfectly with regard to checkerplay as well as doubling cube handling. Moreov ..."
Abstract
 Add to MetaCart
This article presents efficient equity approximations for backgammon races based on statistical analyses. In conjunction with a 1ply search the constructed evaluation functions allow a program to play short races almost perfectly with regard to checkerplay as well as doubling cube handling
Markov random fields with efficient approximations
 In IEEE Conference on Computer Vision and Pattern Recognition
, 1998
"... Markov Random Fields (MRF’s) can be used for a wide variety of vision problems. In this paper we focus on MRF’s with twovalued clique potentials, which form a generalized Potts model. We show that the maximum a posteriori estimate of such an MRF can be obtained by solving a multiway minimum cut pro ..."
Abstract

Cited by 210 (23 self)
 Add to MetaCart
problem on a graph. We develop efficient algorithms for computing good approximations to the minimum multiway cut. The visual correspondence problem can be formulated as an MRF in our framework; this yields quite promising results on real data with ground truth. We also apply our techniques to MRF
Efficient Approximation for Triangulation of Minimum Treewidth
 IN PROCEEDINGS OF THE 17TH CONFERENCE ON UNCERTAINTY IN ARTIFICIAL INTELLIGENCE
, 2001
"... We present four novel approximation algorithms for finding triangulation of minimum treewidth. Two of the algorithms improve on the running times of algorithms by Robertson and Seymour, and Becker and Geiger that approximate the optimum by factors of 4 and 3 2/3, respectively. A third algorithm is ..."
Abstract

Cited by 89 (11 self)
 Add to MetaCart
intelligence, VLSI design and databases are efficiently solvable if we have an efficient approximation algorithm for them. We report on experimental results confirming the effectiveness of our algorithms for large graphs associated with realworld problems.
Efficient Approximation of Gaussian Filters
"... This correspondence presents improvements to the efficient approximation of Gaussian filters by sequentially applying uniform box filters. For onedimensional filters a simple and nearly optimal fit criterion for the length N of the box filters to the approximated Gaussian is given. For twodimensio ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This correspondence presents improvements to the efficient approximation of Gaussian filters by sequentially applying uniform box filters. For onedimensional filters a simple and nearly optimal fit criterion for the length N of the box filters to the approximated Gaussian is given. For two
A Threshold of ln n for Approximating Set Cover
 JOURNAL OF THE ACM
, 1998
"... Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NPhar ..."
Abstract

Cited by 776 (5 self)
 Add to MetaCart
hard. We prove that (1 \Gamma o(1)) ln n is a threshold below which set cover cannot be approximated efficiently, unless NP has slightly superpolynomial time algorithms. This closes the gap (up to low order terms) between the ratio of approximation achievable by the greedy algorithm (which is (1 \Gamma
Efficient Approximation of Product Distributions
 in Proceedings of the 24th Annual ACM Symposium on Theory of Computing
, 1998
"... We describe efficient constructions of small probability spaces that approximate the joint distribution of general random variables. Previous work on efficient constructions concentrate on approximations of the joint distribution for the special case of identical, uniformly distributed random var ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
We describe efficient constructions of small probability spaces that approximate the joint distribution of general random variables. Previous work on efficient constructions concentrate on approximations of the joint distribution for the special case of identical, uniformly distributed random
Efficient approximation of convex recolorings
 In Proceedings APPROX 2005: 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, published with Proceedings RANDOM 2005
, 2005
"... A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to some of the vertices) is convex if it can be completed to a convex (total) coloring. Convex coloring of trees arises in areas such as phylogenetics, lingui ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
vertices ” w.r.t. to a closest convex coloring. The problem was proved to be NPhard even for colored strings. In this paper we continue the work of [18], and present a 2approximation algorithm of convex recoloring of strings whose running time O(cn), where c is the number of colors and n is the size
Constructing Free Energy Approximations and Generalized Belief Propagation Algorithms
 IEEE Transactions on Information Theory
, 2005
"... Important inference problems in statistical physics, computer vision, errorcorrecting coding theory, and artificial intelligence can all be reformulated as the computation of marginal probabilities on factor graphs. The belief propagation (BP) algorithm is an efficient way to solve these problems t ..."
Abstract

Cited by 585 (13 self)
 Add to MetaCart
Important inference problems in statistical physics, computer vision, errorcorrecting coding theory, and artificial intelligence can all be reformulated as the computation of marginal probabilities on factor graphs. The belief propagation (BP) algorithm is an efficient way to solve these problems
Efficient Approximations of Conjunctive Queries
"... When finding exact answers to a query over a large database is infeasible, it is natural to approximate the query by a more efficient one that comes from a class with good bounds on the complexity of query evaluation. In this paper we study such approximations for conjunctive queries. These queries ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
When finding exact answers to a query over a large database is infeasible, it is natural to approximate the query by a more efficient one that comes from a class with good bounds on the complexity of query evaluation. In this paper we study such approximations for conjunctive queries. These queries
Results 1  10
of
26,161