134 search results - page 25 / 27 » Finiteness Conditions for Strictness Analysis |
73
Voted
TSP
2008
14 years 11 months ago
2008
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
111
Voted
DCC
2004
IEEE
15 years 3 months ago
2004
IEEE
Providing continuous video playback with graceful quality degradation over wireless channels is fraught with challenges. Video applications require stringent delay guarantees and ...
104
Voted
JAR
2006
14 years 11 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
103
click to vote
CADE
2005
Springer
15 years 12 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...