327 search results - page 32 / 66 » Algorithms for infinite huffman-codes |
JUCS
2006
13 years 7 months ago
2006
: Behavioural specifications allow to focus only on the"observable" behaviour of objects. These observations are made through "observable contexts" which are pa...
COMBINATORICA
2008
13 years 6 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
AMC
2008
13 years 7 months ago
2008
This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
We present a new approach for shape metamorphism, which is a process of gradually changing a source shape (known) through intermediate shapes (unknown) into a target shape (known)...
CADE
2008
Springer
14 years 7 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...