11716 search results - page 274 / 2344 » Computable symbolic dynamics |
166
click to vote
DCC
2007
IEEE
16 years 6 months ago
2007
IEEE
We address the problem of a finite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large ...
173
click to vote
DCC
2010
IEEE
16 years 1 months ago
2010
IEEE
Word-based compression over natural language text has shown to be a good choice to trade compression ratio and speed, obtaining compression ratios close to 30% and very fast decom...
160
click to vote
VMCAI
2009
Springer
16 years 1 months ago
2009
Springer
—A variety of partial modeling formalisms, aimed re and reason about abstractions, have been proposed. Some, e.g., Kripke Modal Transition Systems (KMTSs) put strong restrictions...
184
click to vote
ISMIS
2009
Springer
16 years 1 months ago
2009
Springer
Workflow mining aims to find graph-based process models based on activities, emails, and various event logs recorded in computer systems. Current workflow mining techniques mainly ...
183
click to vote
COCOON
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable as...