7129 search results - page 172 / 1426 » Approximation Algorithms for Treewidth |
128
click to vote
WADS
2005
Springer
15 years 9 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
95
Voted
APPROX
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of approximating the average distance between pairs of points in a high-dimensional Euclidean space, and more generally in any metric space. We co...
154
Voted
SODA
2008
ACM
15 years 5 months ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
105
Voted
NIPS
2003
15 years 5 months ago
2003
Belief propagation on cyclic graphs is an efficient algorithm for computing approximate marginal probability distributions over single nodes and neighboring nodes in the graph. I...
124
Voted
ISCAS
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— Approximation of Toeplitz matrices with circulant matrices is a well-known approach to reduce the computational complexity of linear equalizers. This paper presents a n...