We prove this conjecture in case (a) and signi cantly extend the range of p and q for which it is known in case (b). In cases (a) and (b), these questions are equivalent to global stability of the xed point (L;L) of the planar map (u; v) = (v; f(u; v)). For as in case (a), we consider natural four dimensional extensions T of 3 and S of . For 0 q < p, we prove that (L;L; L; L) is a global stable...

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 ...

Given a set S of n points in IR D , D 2. Each point p 2 S is assigned a color c(p) chosen from a xed color set. The All-Nearest-Foreign-Neighbors Problem (ANFNP) is to nd for each point p 2 S its nearest foreign neighbors, i.e. the set of all points in Snfpg that are closest to p among the points in S with a color diierent from c(p). We introduce the Well Separated Color Decomposition (WSCD) wh...

abstract. In this article we study interpolation properties for the minimal system of interpretability logic IL. We prove that arrow interpolation holds for IL and that turnstile interpolation and interpolation for the-modality easily follow from this result. Furthermore , these properties are extended to the system ILP. Failure of arrow interpolation for ILW is established by providing an expl...

We introduce Partitioned Dependency Graphs (PDGs), an abstract framework for the speciication and evaluation of arbitrarily nested alternating xed points. The generality of PDGs subsumes that of similarly proposed models of nested xed-point computation such as Boolean graphs, Boolean equation systems, and the propositional modal mu-calculus. Our main result is an eecient local algorithm for eva...

Consider a \black box" having I input channels and J output channels. Each arrival on an input channel gets routed through the black box and appears on an output channel. The system is monitored for a xed time period and a record is made of the number of arrivals on each input channel and the number of departures on each output channel. The OD (origination-destination) matrix estimation problem...

SUMMARY: Multivariate versions of variable bandwidth kernel density estimators can be used to combat the eeects of the curse of dimensionality. They are also more exible than the xed bandwidth estimator to model complex (multimodal) densities. In this work, two variable bandwidth estimators are discussed: the balloon estimator which varies the smoothing matrix with each estimation point and the...