327 search results - page 22 / 66 » Algorithms for infinite huffman-codes |
92
Voted
CSR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
84
Voted
IPL
2006
15 years 17 days ago
2006
In the past 5 years, a series of verification algorithms has been proposed for infinite Markov chains that have a finite attractor, i.e., a set that will be visited infinitely oft...
98
Voted
IFIPTCS
2010
14 years 10 months ago
2010
Abstract. We present a game-theoretic framework for modeling and solving routing problems in dynamically changing networks. The model covers the aspects of reactivity and non-termi...
119
Voted
ICGI
2010
Springer
14 years 10 months ago
2010
Springer
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
83
Voted
MOC
2000
15 years 11 days ago
2000
Abstract. I describe a modification to Shanks' baby-step giant-step algorithm for computing the order n of an element g of a group G, assuming n is finite. My method has the a...