729 search results - page 48 / 146 » Solving subgraph isomorphism problems with constraint progra... |
114
Voted
ICASSP
2009
IEEE
15 years 7 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...
131
Voted
IFIP12
2004
15 years 5 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...
117
Voted
SIAMJO
2010
14 years 10 months 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 ...
123
Voted
CPAIOR
2007
Springer
15 years 9 months 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...
146
Voted
CONSTRAINTS
2007
15 years 3 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 ...