Sciweavers

1204 search results - page 34 / 241
» Termination of Polynomial Programs
Sort
View
ICASSP
2011
IEEE
13 years 2 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
ORL
2008
50views more  ORL 2008»
13 years 11 months ago
Exploiting equalities in polynomial programming
We propose a novel solution approach for polynomial programming problems with equality constraints. By means of a generic transformation, we show that solution schemes for the (ty...
Javier Peña, Juan Carlos Vera, Luis F. Zulu...
IEEECIT
2010
IEEE
13 years 9 months ago
Decompression Method for Massive Compressed Files in Mobile Rich Media Applications
Aiming at the characteristics of mobile terminal equipments, the program of decompressing massive compressed files in mobile rich media applications is investigated in this paper....
Houchen Li, Zhijie Qiu, Lei Luo
DBPL
1999
Springer
109views Database» more  DBPL 1999»
14 years 3 months ago
Expressing Topological Connectivity of Spatial Databases
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries...
Floris Geerts, Bart Kuijpers
ICGA
1997
126views Optimization» more  ICGA 1997»
14 years 9 days ago
Evolution of Graph-Like Programs with Parallel Distributed Genetic Programming
Parallel Distributed Genetic Programming (PDGP) is a new form of Genetic Programming (GP) suitable for the development of programs with a high degree of parallelism. Programs are ...
Riccardo Poli