For a subshift of nite type and a xed HH older continuous function, the zero measure invariant set of points where the Birkhoo averages do not exist is either empty or carries full Hausdorr dimension. Similar statements hold for conformal repellers and two-dimensional horseshoes, and the set of points where the pointwise dimensions, local entropies, Lyapunov exponents, and Birkhoo averages do n...

We introduce domain theory in dynamical systems, iterated function systems (fractals) and measure theory. For a discrete dynamical system given by the action of a continuous map f : X ! X on a metric space X, we study the extended dynamical systems (V X; V f), (UX; Uf) and (LX;Lf) where V , U and L are respectively the Vietoris hyperspace, the upper hyperspace and the lower hyperspace functors....

Binary Decision Diagrams are in widespread use in veriication systems for the canonical representation of Boolean functions. A BDD representing a function ' : B ! N can easily be reduced to its canonical form in linear time. In this paper, we consider a natural online BDD reenement problem and show that it can be solved in O(n log n) if n bounds the size of the BDD and the total size of update ...

This paper addresses the problem of reconstructing the trajectory of a point viewed by an uncalibrated moving camera, in which at each frame all that is known is the 3D position of the camera. When the camera's inner parameters are also given it is trivial to reconstruct a xed point in space, which is the intersection of the rays given by the camera's centers and the viewed pixels. When the 3D ...

We consider the problem of nding models for logic programs P via xed points of immediate consequence operators TP Certain extensions of syntax invalidate the classical approach adopted in the case of de nite programs using iterates of TP and the Knaster Tarski theorem We discuss alternatives to the use of this theorem based on elementary notions from topological dynamics This leads us to consid...

The Longest common subsequence problem is examined from the point of view of parameterized computational complexity. There are several diierent ways in which parameters enter the problem, such as the number of sequences to be analyzed, the length of the common subsequence, and the size of the alphabet. Lower bounds on the complexity of this basic problem imply lower bounds on a number of other ...

This report addresses the problem of computation of the output of the Weighted Myriad Filter. Weighted Myriad Filters form a large and important class of nonlinear lters that includes linear FIR lters, with several potential applications in robust signal processing and communications in impulsive non-Gaussian environments. Just as the weighted mean and the weighted median are optimized for the ...