Sciweavers

5247 search results - page 416 / 1050
» Frequency Optimized Computation Methods
Sort
View
FCT
2003
Springer
15 years 9 months ago
Proving Integrality Gaps without Knowing the Linear Program
: Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic app...
Sanjeev Arora
ICPR
2004
IEEE
16 years 5 months ago
Large Scale Feature Selection Using Modified Random Mutation Hill Climbing
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
Anil K. Jain, Michael E. Farmer, Shweta Bapna
GECCO
2010
Springer
156views Optimization» more  GECCO 2010»
15 years 7 months ago
Elementary landscape decomposition of the quadratic assignment problem
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
J. Francisco Chicano, Gabriel Luque, Enrique Alba
TSP
2008
114views more  TSP 2008»
15 years 3 months ago
Zero-Forcing Precoding and Generalized Inverses
Abstract--We consider the problem of linear zero-forcing precoding design and discuss its relation to the theory of generalized inverses in linear algebra. Special attention is giv...
Ami Wiesel, Yonina C. Eldar, Shlomo Shamai
ICASSP
2011
IEEE
14 years 7 months ago
Error-entropy based channel state estimation of spatially correlated MIMO-OFDM
—This paper deals with optimized training sequences to estimate multiple-input multiple-output orthogonal frequencydivision multiplexing (MIMO-OFDM) channel states in the presenc...
Hoang Duong Tuan, Ha Hoang Kha, Ha H. Nguyen