Sciweavers

5331 search results - page 154 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
NIPS
2008
14 years 11 months ago
Deflation Methods for Sparse PCA
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...
Lester Mackey
ISMB
1994
14 years 11 months ago
An Efficient Method for Multiple Sequence Alignment
Multiple sequence alignment has been a useful methodin the study of molecular evolution and sequence-structure relationships. This paper presents a newmethodfor multiple sequence ...
Jin Kim, Sakti Pramanik
WSC
2008
15 years 11 days ago
Discrete stochastic optimization using linear interpolation
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....
Honggang Wang, Bruce W. Schmeiser
SIAMSC
2011
142views more  SIAMSC 2011»
14 years 5 months ago
Efficiency Based Adaptive Local Refinement for First-Order System Least-Squares Formulations
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...
J. H. Adler, Thomas A. Manteuffel, Stephen F. McCo...
ISPDC
2007
IEEE
15 years 4 months ago
On Grid-based Matrix Partitioning for Heterogeneous Processors
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 ...
Alexey L. Lastovetsky