7129 search results - page 253 / 1426 » Approximation Algorithms for Treewidth |
140
click to vote
GBRPR
2005
Springer
15 years 9 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
142
click to vote
ICASSP
2009
IEEE
15 years 11 months ago
2009
IEEE
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...
114
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been ...
135
click to vote
DATE
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper describes a scalable, technology-independent algorithm for the synthesis of approximate logic circuits. A low overhead, non-intrusive solution for concurrent error dete...
236
click to vote
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...