50 search results - page 6 / 10 » Lagrange Multiplier Method for Multi-campaign Assignment Pro... |
86
Voted
AAAI
2012
12 years 12 months ago
2012
Given a monochrome image and some manually labeled pixels, the colorization problem is a computer-assisted process of adding color to the monochrome image. This paper proposes a n...
92
Voted
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
INFOCOM
1991
IEEE
15 years 1 months ago
1991
IEEE
Although the issues of routing and scheduling in packet radio networks are highly interdependent, few studies have addressed their interactions. In this paper, we address the prob...
76
Voted
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we propose a robust and efficient algorithm for generalized orthonormal discriminant vectors (GODV). The major advantage of the proposed method is the use of the ra...