433 search results - page 26 / 87 » A greedy approximation algorithm for the group Steiner probl... |
ICASSP
2011
IEEE
13 years 7 days ago
2011
IEEE
In this paper, we consider the problem of manifold approximation with affine subspaces. Our objective is to discover a set of low dimensional affine subspaces that represents ma...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a...
ALGORITHMICA
1998
13 years 8 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
JCO
2010
13 years 7 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...