14548 search results - page 86 / 2910 » The Optimal Path-Matching Problem |
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
CPAIOR
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
SIAMCO
2002
13 years 9 months ago
2002
As shown in [7], optimal control problems with either ODE or PDE dynamics can be solved efficiently using a setting of consistent approximations obtained by numerical discretizati...
ICIP
2010
IEEE
13 years 8 months ago
2010
IEEE
The 2- 1 compressed sensing minimization problem can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel...
WIOPT
2011
IEEE
13 years 1 months ago
2011
IEEE
—In this paper, we address the spectrum portfolio optimization (SPO) question in the context of secondary spectrum markets, where bandwidth (spectrum access rights) can be bought...