Sciweavers

229 search results - page 21 / 46
» Bilateral Algorithms for Symbolic Abstraction
Sort
View
ICC
2009
IEEE
159views Communications» more  ICC 2009»
14 years 3 months ago
An Enhanced Multiple-Feedback Algorithm for RFID MAC Protocols
Abstract— This paper introduces two new tree-based anticollision schemes using multiple feedback symbols for uplink tag random access of emerging radio frequency identification (...
You-Chang Ko, Sumit Roy, Choong-Ho Cho, Hyong-Woo ...
JSAC
1998
81views more  JSAC 1998»
13 years 8 months ago
Early Detection and Trellis Splicing: Reduced-Complexity Iterative Decoding
Abstract—The excellent bit error rate performance of new iterative decoding algorithms (e.g., turbodecoding) is achieved at the expense of a computationally burdensome decoding p...
Brendan J. Frey, Frank R. Kschischang
STRINGOLOGY
2008
13 years 10 months ago
Conservative String Covering of Indeterminate Strings
Abstract. We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2] . . . T...
Pavlos Antoniou, Maxime Crochemore, Costas S. Ilio...
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
13 years 10 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
QEST
2010
IEEE
13 years 6 months ago
Symblicit Calculation of Long-Run Averages for Concurrent Probabilistic Systems
Abstract--Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scan...
Ralf Wimmer, Bettina Braitling, Bernd Becker, Erns...