729 search results - page 48 / 146 » Solving subgraph isomorphism problems with constraint progra... |
141
click to vote
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper, we solve the problem of detecting the entries of a sparse finite-alphabet signal from a limited amount of data, for instance obtained by compressive sampling. While...
166
click to vote
IFIP12
2004
15 years 7 months ago
2004
The recent deregulation occurred in the public railway sector in many parts of the world has increased the awareness of this sector of the need for quality service that must be oer...
142
click to vote
SIAMJO
2010
15 years 22 days ago
2010
Abstract. We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of approximate semismooth Newton methods. In ...
144
click to vote
CPAIOR
2007
Springer
16 years 4 days ago
2007
Springer
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
176
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...