Sciweavers

349 search results - page 34 / 70
» The Finite and the Infinite
Sort
View
TIT
2002
72views more  TIT 2002»
13 years 9 months ago
Universal codes for finite sequences of integers drawn from a monotone distribution
We offer two noiseless codes for blocks of integers Xn = (X1, . . . , Xn). We provide explicit bounds on the relative redundancy that are valid for any distribution F in the class...
Dean P. Foster, Robert A. Stine, Abraham J. Wyner
BIRTHDAY
2008
Springer
13 years 12 months ago
Unfolding Graph Transformation Systems: Theory and Applications to Verification
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
Paolo Baldan, Andrea Corradini, Barbara König
JUCS
2006
97views more  JUCS 2006»
13 years 9 months ago
An Interval Constraint Branching Scheme for Lattice Domains
This paper presents a parameterized schema for interval constraint branching that (with suitable instantiations of the parameters) can solve interval constraint satisfaction probl...
Antonio J. Fernández, Patricia M. Hill
TCS
2008
13 years 9 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
AUTOMATICA
2002
95views more  AUTOMATICA 2002»
13 years 9 months ago
Series expansions for analytic systems linear in control
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
Francesco Bullo