— This paper addresses the problem of localizing a source from noisy time-of-arrival measurements. In particular, we are interested in the optimal placement of M planar sensors s...
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...
This paper describes a technique for the probabilistic self-localization of a sensor network based on noisy inter-sensor range data. Our method is based on a number of parallel in...
This paper presents a spectral method for identifying multiple texture planes. We commence by showing how pairs of spectral peaks can be used to make direct estimates of the slant...
If a program does not fulfill a given specification, a model checker delivers a counterexample, a run which demonstrates the wrong behavior. Even with a counterexample, locating...