557 search results - page 72 / 112 » On the set multi-cover problem in geometric settings |
ISSAC
2007
Springer
14 years 3 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
STACS
2010
Springer
14 years 4 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
IWCM
2004
Springer
14 years 2 months ago
2004
Springer
We present a variational approach for segmenting the image plane into regions of piecewise parametric motion given two or more frames from an image sequence. Our model is based on ...