557 search results - page 17 / 112 » On the set multi-cover problem in geometric settings |
180
click to vote
GD
2007
Springer
16 years 24 days ago
2007
Springer
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...
209
click to vote
VLSM
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. Many problems in image analysis and computer vision involving boundaries and regions can be cast in a variational formulation. This means that m-surfaces, e.g. curves and...
198
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
143
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
In this paper we establish a topological similarity between two apparently different shape constructors from a set of points. Shape constructors are geometric structures that tran...
235
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...