64 search results - page 7 / 13 » Compression of Partially Ordered Strings |
70
Voted
SPIRE
2009
Springer
15 years 4 months ago
2009
Springer
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...
90
Voted
DEDS
2008
14 years 9 months ago
2008
This paper deals with the on-line monitoring of large systems modeled as Petri Nets under partial observation. The plant observation is given by a subset of transitions whose occu...
123
Voted
LICS
2012
IEEE
12 years 12 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
PPOPP
2003
ACM
15 years 2 months ago
2003
ACM
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
90
Voted
CASES
2006
ACM
15 years 3 months ago
2006
ACM
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...