2370 search results - page 9 / 474 » A Structured Set of Higher-Order Problems |
COMPGEOM
2001
ACM
15 years 1 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
Shape optimization is a problem which arises in numerous computer vision problems such as image segmentation and multiview reconstruction. In this paper, we focus on a certain clas...
101
Voted
JC
2011
14 years 4 months ago
2011
It has been an open problem to derive a necessary and sufficient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...
SIAMJO
2008
14 years 9 months ago
2008
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
103
click to vote
FOCM
2010
14 years 8 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...