Related papers: Technical details of distributed localization
In this paper an iterated function system on the space of distribution functions is built. The inverse problem is introduced and studied by convex optimization problems. Some applications of this method to approximation of distribution…
Generally, the normal displacement-based formation control has a sensing mode that requires the agent not only to have certain knowledge of its direction, but also to gather its local information characterized by nonnegative coupling…
We discuss a graph-based approach for testing spatial point patterns. This approach falls under the category of data-random graphs, which have been introduced and used for statistical pattern recognition in recent years. Our goal is to test…
We describe the implementation of a topological constraint in finite element simulations of phase field models which ensures path-connectedness of preimages of intervals in the phase field variable. Two main applications of our method are…
Consider a distributed coding for computing problem with constant decoding locality, i.e., with a vanishing error probability, any single sample of the function can be approximately recovered by probing only constant number of compressed…
We present a simple and general method for construction of localized orbitals to describe electronic structure of extended periodic metals and insulators as well as confined systems. Spatial decay of these orbitals is found to exhibit…
In this paper, we study a connection between disintegration of measures and geometric properties of probability spaces. We prove a disintegration theorem, addressing disintegration from the perspective of an optimal transport problem. We…
Parametric unfolding of a true distribution distorted due to finite resolution and limited efficiency for the registration of individual events is discussed. Details of the computational algorithm of the unfolding procedure are presented.
Cooperative geolocation has attracted significant research interests in recent years. A large number of localization algorithms rely on the availability of statistical knowledge of measurement errors, which is often difficult to obtain in…
We describe the use of array expressions as constraints, which represents a consequent generalisation of the "element" constraint. Constraint propagation for array constraints is studied theoretically, and for a set of domain reduction…
We propose a fast and scalable algorithm to project a given density on a set of structured measures defined over a compact 2D domain. The measures can be discrete or supported on curves for instance. The proposed principle and algorithm are…
We study large partial sums, localized with respect to the sums of variances, of a sequence of centered random variables. An application is given to the distribution of prime factors of typical integers.
We consider variational problems that model the bending behavior of curves that are constrained to belong to given hypersurfaces. Finite element discretizations of corresponding functionals are justified rigorously via Gamma-convergence.…
This paper is a companion paper to [Lipman and Daubechies 2011]. We provide numerical procedures and algorithms for computing the alignment of and distance between two disk type surfaces. We provide a convergence analysis of the discrete…
Anderson localization provides a challenge to numerical approaches due to the inherent randomness, and hence absence of simple symmetries, in its discrete Hamiltonian representation. Numerous algorithmic approaches have been developed or…
We establish new and different kinds of proofs of properties that arise due to the orthogonal decomposition of the Hilbert space, including projections, over the unit interval of one dimension. We also see angles between functions,…
This paper is devoted to studying of some properties of multivalued mappings in Euclidean space. There were proved theorems on a fixed point for multivalued mappings whose restrictions to some subset in the closure of a domain satisfy "a…
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…
Fractional diffusion equations are widely used to describe anomalous diffusion processes where the characteristic displacement scales as a power of time. For processes lacking such scaling the corresponding description may be given by…
In this work we establish a theory of Calculus based on the new concept of displacement. We develop all the concepts and results necessary to go from the definition to differential equations, starting with topology and measure and moving on…