Sciweavers

567 search results - page 56 / 114
» Decomposing replicable functions
Sort
View
104
Voted
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 24 days ago
Non-Negative Matrix Factorization, Convexity and Isometry
Traditional Non-Negative Matrix Factorization (NMF) [19] is a successful algorithm for decomposing datasets into basis function that have reasonable interpretation. One problem of...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...
80
Voted
EOR
2008
150views more  EOR 2008»
15 years 24 days ago
Portfolio optimization when asset returns have the Gaussian mixture distribution
Abstract. Portfolios of assets whose returns have the Gaussian mixture distribution are optimized in the static setting to find portfolio weights and efficient frontiers using the ...
Ian Buckley, David Saunders, Luis Seco
130
Voted
IWSEC
2010
Springer
14 years 11 months ago
Security Metrics and Security Investment Models
Abstract. Planning information security investment is somewhere between art and science. This paper reviews and compares existing scientific approaches and discusses the relation ...
Rainer Böhme
EC
2010
176views ECommerce» more  EC 2010»
14 years 10 months ago
Learning Factorizations in Estimation of Distribution Algorithms Using Affinity Propagation
Estimation of distribution algorithms (EDAs) that use marginal product model factorizations have been widely applied to a broad range of, mainly binary, optimization problems. In ...
Roberto Santana, Pedro Larrañaga, Jos&eacut...
TRANSCI
2011
80views more  TRANSCI 2011»
14 years 7 months ago
The Dynamic Uncapacitated Hub Location Problem
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
Ivan Contreras, Jean-François Cordeau, Gilb...