Sciweavers

12825 search results - page 90 / 2565
» Improved PLSOM algorithm
Sort
View
109
Voted
WEA
2004
Springer
120views Algorithms» more  WEA 2004»
15 years 8 months ago
An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
Vinhthuy T. Phan, Steven Skiena
133
Voted
ESA
2003
Springer
140views Algorithms» more  ESA 2003»
15 years 7 months ago
Improved Approximation of the Stable Marriage Problem
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
Magnús M. Halldórsson, Kazuo Iwama, ...
ICASSP
2011
IEEE
14 years 6 months ago
Improving melody extraction using Probabilistic Latent Component Analysis
We propose a new approach for automatic melody extraction from polyphonic audio, based on Probabilistic Latent Component Analysis (PLCA). An audio signal is first divided into vo...
Jinyu Han, Ching-Wei Chen
ICASSP
2011
IEEE
14 years 6 months ago
Improvement to esprit-type frequency estimators via reducing data redundancy
In this paper, the problem of estimating the damping factor and frequency parameters from multiple cisoids in noise is addressed. We rst propose a data matrix which generalizes th...
Weize Sun, Hing Cheung So
188
Voted
ESA
2011
Springer
257views Algorithms» more  ESA 2011»
14 years 2 months ago
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
We study and characterize social-aware forwarding protocols in opportunistic networks and we derive bounds on the expected message delivery time for two different routing protocol...
Josep Díaz, Alberto Marchetti-Spaccamela, D...