Sciweavers

1191 search results - page 3 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
AAAI
2012
13 years 1 months ago
Colorization by Matrix Completion
Given a monochrome image and some manually labeled pixels, the colorization problem is a computer-assisted process of adding color to the monochrome image. This paper proposes a n...
Shusen Wang, Zhihua Zhang
ICASSP
2011
IEEE
14 years 2 months ago
Reconstructing completely overlapped notes from musical mixtures
In mixtures of musical sounds, the problem of overlapped harmonics poses a significant challenge to source separation. Common Amplitude Modulation (CAM) is one of the most effect...
Jinyu Han, Bryan Pardo
ICASSP
2011
IEEE
14 years 2 months ago
Low-rank matrix completion by variational sparse Bayesian learning
There has been a significant interest in the recovery of low-rank matrices from an incomplete of measurements, due to both theoretical and practical developments demonstrating th...
S. Derin Babacan, Martin Luessi, Rafael Molina, Ag...
AIIA
2003
Springer
15 years 4 months ago
A Complete Subsumption Algorithm
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
Stefano Ferilli, Nicola Di Mauro, Teresa Maria Alt...
GECCO
2003
Springer
116views Optimization» more  GECCO 2003»
15 years 4 months ago
A Hybrid Genetic Algorithm Based on Complete Graph Representation for the Sequential Ordering Problem
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
Dong-il Seo, Byung Ro Moon