Sciweavers

2370 search results - page 9 / 474
» A Structured Set of Higher-Order Problems
Sort
View
COMPGEOM
2001
ACM
14 years 13 days ago
Segment intersection searching problems in general settings
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...
Vladlen Koltun
ECCV
2008
Springer
14 years 10 months ago
An Experimental Comparison of Discrete and Continuous Shape Optimization Methods
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...
Maria Klodt, Thomas Schoenemann, Kalin Kolev, Mare...
JC
2011
102views more  JC 2011»
13 years 3 months ago
Tractability of tensor product problems in the average case setting
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 ...
Anargyros Papageorgiou, Iasonas Petras
SIAMJO
2008
85views more  SIAMJO 2008»
13 years 8 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
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...
Igor Averbakh, Yun-Bin Zhao
FOCM
2010
97views more  FOCM 2010»
13 years 7 months ago
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets
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...
Levent Tunçel, Arkadi Nemirovski