Sciweavers

14548 search results - page 342 / 2910
» The Optimal Path-Matching Problem
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Global convergence of independent component analysis based on semidefinite programming relaxation
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
Shotaro Akaho, Jun Fujiki
CISIS
2011
IEEE
14 years 6 months ago
Agent-based Pickup and Delivery Planning: The Learnable Evolution Model Approach
—The Dynamic Vehicle Routing Problem (DVRP) is an optimization problem in which agents deliver orders that are not known in advance to the routing. Partial solutions need to be a...
Janusz Wojtusiak, Tobias Warden, Otthein Herzog
CISS
2011
IEEE
14 years 10 months ago
On linear processing for dual-hop multi-channel relaying
—In this paper, we consider the amplified-and-forward relaying in a multichannel system with linear processing capability at the relay. We propose an analytical approach to stud...
Min Dong, Mahdi Hajiaghayi, Ben Liang
INFOCOM
2010
IEEE
15 years 5 months ago
Pattern Mutation in Wireless Sensor Deployment
—In this paper, we study the optimal deployment pattern problem in wireless sensor networks (WSNs). We propose a new set of patterns, particularly when sensors’ communication r...
Xiaole Bai, Ziqiu Yun, Dong Xuan, Weijia Jia, Wei ...
SDM
2010
SIAM
168views Data Mining» more  SDM 2010»
15 years 5 months ago
Convex Principal Feature Selection
A popular approach for dimensionality reduction and data analysis is principal component analysis (PCA). A limiting factor with PCA is that it does not inform us on which of the o...
Mahdokht Masaeli, Yan Yan, Ying Cui, Glenn Fung, J...