2542 search results - page 188 / 509 » Computing Cartograms with Optimal Complexity |
128
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
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...
105
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
126
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
A problem of joint optimal bandwidth and power allocation in cognitive networks under fading channels is considered. It is assumed that multiple secondary users (SUs) share the sp...
123
Voted
CIAC
2010
Springer
15 years 4 months ago
2010
Springer
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
151
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...