697 search results - page 75 / 140 » Convex Functions on Discrete Sets |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
COMPGEOM
2003
ACM
14 years 2 months ago
2003
ACM
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...
TROB
2002
13 years 8 months ago
2002
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
ICMLA
2004
13 years 10 months ago
2004
AdaBoost rarely suffers from overfitting problems in low noise data cases. However, recent studies with highly noisy patterns clearly showed that overfitting can occur. A natural s...
PAMI
2007
13 years 8 months ago
2007
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...