Sciweavers

1019 search results - page 126 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
ICASSP
2009
IEEE
14 years 3 months ago
Sparse source separation from orthogonal mixtures
This paper addresses source separation from a linear mixture under two assumptions: source sparsity and orthogonality of the mixing matrix. We propose efficient sparse separation...
Moshe Mishali, Yonina C. Eldar
CMSB
2004
Springer
14 years 2 months ago
Modelling Metabolic Pathways Using Stochastic Logic Programs-Based Ensemble Methods
In this paper we present a methodology to estimate rates of enzymatic reactions in metabolic pathways. Our methodology is based on applying stochastic logic learning in ensemble le...
Huma Lodhi, Stephen Muggleton
IJCNN
2000
IEEE
14 years 1 months ago
Metrics that Learn Relevance
We introduce an algorithm for learning a local metric to a continuous input space that measures distances in terms of relevance to the processing task. The relevance is defined a...
Samuel Kaski, Janne Sinkkonen
GECCO
2009
Springer
141views Optimization» more  GECCO 2009»
14 years 3 months ago
Distributed hyper-heuristics for real parameter optimization
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance tha...
Marco Biazzini, Balázs Bánhelyi, Alb...
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
14 years 3 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner