1672 search results - page 176 / 335 » Tightness problems in the plane |
CCCG
2010
15 years 21 days ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
123
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
ECCV
2004
Springer
16 years 1 months ago
2004
Springer
Abstract. Segmentation and blind restoration are both classical problems, that are known to be difficult and have attracted major research efforts. This paper shows that the two pr...
114
click to vote
ICML
2008
IEEE
16 years 2 days ago
2008
IEEE
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
PODS
2008
ACM
15 years 11 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...