5331 search results - page 154 / 1067 » Algebraic Methods for Optimization Problems |
121
click to vote
NIPS
2008
15 years 3 months ago
2008
In analogy to the PCA setting, the sparse PCA problem is often solved by iteratively alternating between two subtasks: cardinality-constrained rank-one variance maximization and m...
117
click to vote
ISMB
1994
15 years 3 months ago
1994
Multiple sequence alignment has been a useful methodin the study of molecular evolution and sequence-structure relationships. This paper presents a newmethodfor multiple sequence ...
113
Voted
WSC
2008
15 years 4 months ago
2008
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
115
Voted
SIAMSC
2011
14 years 8 months ago
2011
Abstract. In this paper, we propose new adaptive local refinement (ALR) strategies for firstorder system least-squares (FOSLS) finite element in conjunction with algebraic multi...
ISPDC
2007
IEEE
15 years 8 months ago
2007
IEEE
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...