Sciweavers

15 search results - page 2 / 3
» The Canonical Generalized Polar Decomposition
Sort
View
JANCL
2008
170views more  JANCL 2008»
13 years 5 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
TSP
2008
90views more  TSP 2008»
13 years 5 months ago
Generalized Correlation Decomposition-Based Blind Channel Estimation in DS-CDMA Systems With Unknown Wide-Sense Stationary Noise
A new blind subspace-based channel estimation technique is proposed for direct-sequence code-division multiple access (DS-CDMA) systems operating in the presence of unknown wide-se...
Keyvan Zarifi, Alex B. Gershman
MMS
2008
13 years 5 months ago
Canonical processes in active reading and hypervideo production
Active reading of audiovisual documents is an iterative activity, dedicated to the analysis of the audiovisual source through its enrichment with structured metadata and the defin...
Olivier Aubert, Pierre-Antoine Champin, Yannick Pr...
TSP
2008
110views more  TSP 2008»
13 years 4 months ago
Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
In this paper, we present a powerful technique for the blind extraction of direct-sequence code-division multiple access (DS-CDMA) signals from convolutive mixtures received by an ...
Lieven De Lathauwer, Alexandre de Baynast
JAPLL
2008
101views more  JAPLL 2008»
13 years 5 months ago
Circle graphs and monadic second-order logic
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...
Bruno Courcelle