562 search results - page 27 / 113 » Approximation algorithms and hardness of the k-route cut pro... |
161
click to vote
ANOR
2004
15 years 6 months ago
2004
We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time perio...
169
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
171
click to vote
PAMI
2007
15 years 5 months ago
2007
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...
193
click to vote
ECCC
2010
15 years 6 months ago
2010
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
134
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design eï¬...