Outputs (2)

How Many Wireless Sensors are Needed to Guarantee Connectivity of a One-Dimensional Network with Random Inter-Node Spacing? (2013)
Journal Article
Kurlin, V., & Mihaylova, L. (2013). How Many Wireless Sensors are Needed to Guarantee Connectivity of a One-Dimensional Network with Random Inter-Node Spacing?. Journal of applied probability and statistics, 8(2), 27-50

An important problem in wireless sensor networks is to nd an optimal number of randomly deployed sensors to guarantee connectivity of the resulting network with a given probability. The authors describe a general method to compute the probabilities o... Read More about How Many Wireless Sensors are Needed to Guarantee Connectivity of a One-Dimensional Network with Random Inter-Node Spacing?.

Reconstructing persistent graph structures from noisy images (2013)
Journal Article
Chernov, A., & Kurlin, V. (2013). Reconstructing persistent graph structures from noisy images. Imagen-a, 3(5), 19-22

Let a point cloud be a noisy dotted image of a graph on the plane. We present a new fast algorithm for reconstructing the original graph from the given point cloud. Degrees of vertices in the graph are found by methods of persistent topology. Necessa... Read More about Reconstructing persistent graph structures from noisy images.