462 search results - page 23 / 93 » Symbolic Bounded Synthesis |
82
Voted
ENTCS
2006
15 years 1 months ago
2006
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
115
click to vote
TWC
2008
15 years 1 months ago
2008
This letter considers multiple symbol differential detection for multiple-antenna systems over flat Ricean-fading channels when partial channel state information (CSI) is available...
132
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Training sequences for estimation of channel parameters have been well designed under the condition that the number of the unknown channel parameters is not greater than the numbe...
97
Voted
DAC
1995
ACM
15 years 5 months ago
1995
ACM
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
COST
2009
Springer
15 years 8 months ago
2009
Springer
While developing lexical resources for a particular language variety (Viennese), we experimented with a set of 5 different phonetic encodings, termed phone sets, used for unit sel...