21 search results - page 4 / 5 » On Approximate Horn Formula Minimization |
FS
2010
13 years 6 months ago
2010
Following the framework of C¸etin, Jarrow and Protter [4] we study the problem of super-replication in presence of liquidity costs under additional restrictions on the gamma of th...
ICCV
2009
IEEE
15 years 11 days 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...
IMR
2004
Springer
14 years 23 days ago
2004
Springer
We present several mesh smoothing schemes based on the concept of optimal Delaunay triangulations. We define the optimal Delaunay triangulation (ODT) as the triangulation that mi...
MANSCI
2008
13 years 7 months ago
2008
We consider the problem of minimizing staffing costs in an inbound call center, while maintaining an acceptable level of service in multiple time periods. The problem is complicat...
TKDE
2008
13 years 7 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...