Sciweavers

393 search results - page 49 / 79
» Convex Programming Methods for Global Optimization
Sort
View
ICCV
2007
IEEE
14 years 1 months ago
Learning The Discriminative Power-Invariance Trade-Off
We investigate the problem of learning optimal descriptors for a given classification task. Many hand-crafted descriptors have been proposed in the literature for measuring visua...
Manik Varma, Debajyoti Ray
ICML
2010
IEEE
13 years 8 months ago
Learning Sparse SVM for Feature Selection on Very High Dimensional Datasets
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
Mingkui Tan, Li Wang, Ivor W. Tsang
LCN
2005
IEEE
14 years 1 months ago
Simulated Annealing based Localization in Wireless Sensor Network
— In this paper, we describe a novel localization method for ad hoc wireless sensor networks. Accurate selforganization and localization is an essential characteristic of high pe...
Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
ICASSP
2011
IEEE
12 years 11 months ago
Robust secondary multicast transmit beamforming for cognitive radio networks under imperfect channel state information
Consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive radio (CR) n...
Yongwei Huang, Qiang Li, Wing-Kin Ma, Shuzhong Zha...
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
14 years 1 months ago
Artificial immune system for solving generalized geometric problems: a preliminary results
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
Jui-Yu Wu, Yun-Kung Chung