Sciweavers

373 search results - page 33 / 75
» Analysis of Recursive State Machines
Sort
View
ICC
2007
IEEE
125views Communications» more  ICC 2007»
15 years 4 months ago
On Bit Error Robustness of Trellis Source Codes
— Trellis codes based on linear congruential recursions have recently been introduced as powerful source codes. For a modest computational complexity they offer excellent rate di...
Tomas Eriksson, Norbert Goertz
CHARME
2001
Springer
107views Hardware» more  CHARME 2001»
15 years 1 months ago
Using Combinatorial Optimization Methods for Quantification Scheduling
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
Pankaj Chauhan, Edmund M. Clarke, Somesh Jha, Jame...
TCOM
2008
124views more  TCOM 2008»
14 years 9 months ago
Reliable adaptive modulation and interference mitigation for mobile radio slow frequency hopping channels
: Due to correlated fading in frequency hopping (FH) wireless communication systems, it is possible to predict the future channel state information (CSI) for one frequency based on...
Ming Lei, Alexandra Duel-Hallen, Hans Hallen
ICML
2008
IEEE
15 years 10 months ago
ICA and ISA using Schweizer-Wolff measure of dependence
We propose a new algorithm for independent component and independent subspace analysis problems. This algorithm uses a contrast based on the Schweizer-Wolff measure of pairwise de...
Barnabás Póczos, Sergey Kirshner
ML
2011
ACM
308views Machine Learning» more  ML 2011»
14 years 4 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...