Sciweavers

17760 search results - page 405 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
IJON
2007
119views more  IJON 2007»
15 years 7 months ago
Finite sample effects of the fast ICA algorithm
Many algorithms for independent component analysis (ICA) and blind source separation (BSS) can be considered particular instances of a criterion based on the sum of two terms: C(Y...
Sergio Bermejo
TALG
2008
127views more  TALG 2008»
15 years 7 months ago
Fully dynamic algorithms for chordal graphs and split graphs
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
Louis Ibarra
GECCO
2010
Springer
189views Optimization» more  GECCO 2010»
15 years 5 months ago
Multiobjective evolutionary algorithm for software project portfolio optimization
Large software companies have to plan their project portfolio to maximize potential portfolio return and strategic alignment, while balancing various preferences, and considering ...
Thomas Kremmel, Jirí Kubalík, Stefan...
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
15 years 2 months ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
Timothy M. Chan
ICIP
2002
IEEE
16 years 9 months ago
A spatiotemporal image sequence restoration algorithm
Temporal restoration of image sequences may fail because of erroneously estimated motion. Motion estimation failures may occur for several reasons: complicated motion, severe arte...
Andrei Rares, Marcel J. T. Reinders, Reginald L. L...