500 search results - page 20 / 100 » Approximation algorithms for maximum independent set of pseu... |
TSMC
2008
15 years 1 months ago
2008
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
ICCD
2003
IEEE
15 years 10 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
101
click to vote
ALGOSENSORS
2007
Springer
15 years 8 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
115
click to vote
ESA
2005
Springer
15 years 7 months ago
2005
Springer
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...
105
click to vote
WADS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...