Sciweavers

4378 search results - page 107 / 876
» On the Complexity of Ordered Colourings
Sort
View
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 9 months ago
Quasi-Orthogonal STBC With Minimum Decoding Complexity
- A new class of Quasi-Orthogonal Space-Time Block Code (QO-STBC) namely Minimum-DecodingComplexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper...
Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung
FSS
2010
111views more  FSS 2010»
13 years 7 months ago
The geometry of consonant belief functions: Simplicial complexes of necessity measures
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
Fabio Cuzzolin
NECO
2010
97views more  NECO 2010»
13 years 7 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
INTERSPEECH
2010
13 years 3 months ago
Chirp complex cepstrum-based decomposition for asynchronous glottal analysis
It was recently shown that complex cepstrum can be effectively used for glottal flow estimation by separating the causal and anticausal components of speech. In order to guarantee...
Thomas Drugman, Thierry Dutoit
ICIP
2006
IEEE
14 years 10 months ago
Variational Unsupervised Segmentation of Multi-Look Complex Polarimetric Images using a Wishart Observation Model
We address unsupervised variational segmentation ofmulti-look complex polarimetric images using a Wishart observation model via level sets. The methods consists of minimizing a fu...
Ismail Ben Ayed, Amar Mitiche, Ziad Belhadj