896 search results - page 8 / 180 » On completeness of word reversing |
120
Voted
SPIRE
2001
Springer
15 years 6 months ago
2001
Springer
The Compact Directed Acyclic Word Graph (CDAWG) is a space efficient data structure that supports indices of a string. The Symmetric Directed Acyclic Word Graph (SCDAWG) for a st...
120
click to vote
CONPAR
1992
15 years 5 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
114
click to vote
IJNSEC
2006
15 years 1 months ago
2006
Over the past few years a number of research papers about reversible watermarks has been produced. Reversible watermarking is a novel category of watermarking schemes. It not only...
111
click to vote
JCB
2007
15 years 1 months ago
2007
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome...
SIGDOC
1992
ACM
15 years 5 months ago
1992
ACM
Softwareprofessionals rely on internaldocumentationas an aid in understanding programs. Unfortunately, the documentation for most programs is usually out-of-date and cannot be tru...