985 search results - page 116 / 197 » Piercing Convex Sets |
126
click to vote
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
134
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
113
Voted
NIPS
2007
15 years 6 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
106
click to vote
CCCG
2006
15 years 6 months ago
2006
A flip or edge-replacement is considered as a transformation by which one edge e of a geometric object is removed and an edge f (f = e) is inserted such that the resulting object ...
121
click to vote
WALCOM
2007
IEEE
15 years 5 months ago
2007
IEEE
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...