Sciweavers

896 search results - page 14 / 180
» On completeness of word reversing
Sort
View
ITA
2008
137views Communications» more  ITA 2008»
13 years 7 months ago
Drunken man infinite words complexity
In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equival...
Marion Le Gonidec
WIOPT
2006
IEEE
14 years 1 months ago
Reverse engineering MAC
— This paper reverse-engineers backoff-based random-access MAC protocols in ad-hoc networks. We show that the contention resolution algorithm in such protocols is implicitly part...
Ao Tang, Jang-Won Lee, Jianwei Huang, Mung Chiang,...
VTS
2003
IEEE
115views Hardware» more  VTS 2003»
14 years 19 days ago
Fault Testing for Reversible Circuits
Irreversible computation necessarily results in energy dissipation due to information loss. While small in comparison to the power consumption of today’s VLSI circuits, if curre...
Ketan N. Patel, John P. Hayes, Igor L. Markov
DCC
1995
IEEE
13 years 11 months ago
CREW: Compression with Reversible Embedded Wavelets
Compression with Reversible Embedded Wavelets (CREW) is a uni ed lossless and lossy continuous-tone still image compression system. It is wavelet-based using a \reversible" a...
A. Zandi, James D. Allen, Edward L. Schwartz, Mart...
LATA
2009
Springer
14 years 2 months ago
Bounded Hairpin Completion
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
Masami Ito, Peter Leupold, Victor Mitrana