Sciweavers

3229 search results - page 358 / 646
» Mixing
Sort
View
ICA
2010
Springer
15 years 6 months ago
Double Sparsity: Towards Blind Estimation of Multiple Channels
We propose a framework for blind multiple filter estimation from convolutive mixtures, exploiting the time-domain sparsity of the mixing filters and the disjointness of the sources...
Prasad Sudhakar, Simon Arberet, Rémi Gribon...
181
Voted
ICA
2010
Springer
15 years 6 months ago
Adaptive Segmentation and Separation of Determined Convolutive Mixtures under Dynamic Conditions
Abstract. In this paper, we propose a method for blind source separation (BSS) of convolutive audio recordings with short blocks of stationary sources, i.e. dynamically changing so...
Benedikt Loesch, Bin Yang
ACTAC
2007
69views more  ACTAC 2007»
15 years 6 months ago
Synthesising Robust Schedules for Minimum Disruption Repair Using Linear Programming
An o-line scheduling algorithm considers resource, precedence, and synchronisation requirements of a task graph, and generates a schedule guaranteeing its timing requirements. Th...
Dávid Hanák, Nagarajan Kandasamy
ALGORITHMICA
2010
107views more  ALGORITHMICA 2010»
15 years 6 months ago
A Universal Online Caching Algorithm Based on Pattern Matching
We present a universal algorithm for the classical online problem of caching or demand paging. We consider the caching problem when the page request sequence is drawn from an unkn...
Gopal Pandurangan, Wojciech Szpankowski
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
15 years 6 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...