Sciweavers

901 search results - page 27 / 181
» Analyzing linear mergers
Sort
View
TC
2008
13 years 8 months ago
High-Performance Designs for Linear Algebra Operations on Reconfigurable Hardware
Numerical linear algebra operations are key primitives in scientific computing. Performance optimizations of such operations have been extensively investigated. With the rapid adva...
Ling Zhuo, Viktor K. Prasanna
NN
2000
Springer
128views Neural Networks» more  NN 2000»
13 years 8 months ago
A recurrent neural network for solving linear projection equations
Linear projection equations arise in many optimization problems and have important applications in science and engineering. In this paper, we present a recurrent neural network fo...
Youshen Xia, Jun Wang
SIAMIS
2010
190views more  SIAMIS 2010»
13 years 3 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin
CVPR
2003
IEEE
14 years 10 months ago
Simultaneous Feature Selection and Classifier Training via Linear Programming: A Case Study for Face Expression Recognition
A linear programming technique is introduced that jointly performs feature selection and classifier training so that a subset of features is optimally selected together with the c...
Guodong Guo, Charles R. Dyer
VMCAI
2009
Springer
14 years 3 months ago
SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
Abstract. We introduce Subpolyhedra (SubPoly) a new numerical abstract domain to infer and propagate linear inequalities. SubPoly is as expressive as Polyhedra, but it drops some o...
Vincent Laviron, Francesco Logozzo