85 search results - page 8 / 17 » Feasible Region Approximation Using Convex Polytopes |
ECCV
2010
Springer
13 years 5 months ago
2010
Springer
Given a set of points corresponding to a 2D projection of a non-planar shape, we would like to obtain a representation invariant to articulations (under no self-occlusions). It is ...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
JGO
2010
13 years 2 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
VISUAL
1999
Springer
13 years 11 months ago
1999
Springer
Blobworld is a system for image retrieval based on nding coherent image regions which roughly correspond to objects. Each image is automatically segmented into regions blobs"...
DIAGRAMS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Area-proportional Venn diagrams are a popular way of visualizing the relationships between data sets, where the set intersections have a specified numerical value. In th...