985 search results - page 159 / 197 » Piercing Convex Sets |
165
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
151
click to vote
SSDBM
2000
IEEE
15 years 10 months ago
2000
IEEE
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
199
click to vote
KSEM
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
145
Voted
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
146
Voted
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Supervised learning of a parts-based model can be for-
mulated as an optimization problem with a large (exponen-
tial in the number of parts) set of constraints. We show how
thi...