Sciweavers

774 search results - page 75 / 155
» A subdivision-based algorithm for the sparse resultant
Sort
View
ICA
2010
Springer
15 years 1 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
IJON
2006
78views more  IJON 2006»
15 years 1 months ago
Improving self-organization of document collections by semantic mapping
In text management tasks, the dimensionality reduction becomes necessary to computation and interpretability of the results generated by machine learning algorithms. This paper de...
Renato Fernandes Corrêa, Teresa Bernarda Lud...
AAAI
1996
15 years 2 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter
TWC
2008
126views more  TWC 2008»
15 years 1 months ago
Coherent and Differential ICI Cancellation for Mobile OFDM with Application to DVB-H
We develop a reduced-complexity hybrid frequency/time-domain orthogonal frequency division multiplexing (OFDM) channel estimation algorithm for high-mobility scenarios where the ch...
Sili Lu, Naofal Al-Dhahir
CORR
2011
Springer
139views Education» more  CORR 2011»
14 years 5 months ago
Clustering Partially Observed Graphs via Convex Optimization
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
Ali Jalali, Yudong Chen, Sujay Sanghavi, Huan Xu