462 search results - page 69 / 93 » Symbolic Bounded Synthesis |
107
click to vote
ALT
2005
Springer
2005
Springer
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
15 years 10 months ago
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the gen...
122
click to vote
CSFW
2009
IEEE
15 years 8 months ago
2009
IEEE
We present a formal model for modeling and reasoning about security protocols. Our model extends standard, inductive, trace-based, symbolic approaches with a formalization of phys...
ICC
2008
IEEE
15 years 8 months ago
2008
IEEE
—OFDM systems have gained outstanding popularity for high data rate wireless communications. In practice, however, the performance of OFDM systems is often limited due to hardwar...
115
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— A computationally efficient optimal double correlation (ODC) filter, which works on the fourth order statistics of received samples, is proposed for carrier frequency...
115
click to vote
ICC
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— We show a statistical pruning approach for maximum likelihood (ML) detection of multiple-input multiple-output (MIMO) systems. We present a general pruning strategy for...