Related papers: Reducing the Complexity of the Sensor-Target Cover…
We give exact and approximation algorithms for two-center problems when the input is a set $\mathcal{D}$ of disks in the plane. We first study the problem of finding two smallest congruent disks such that each disk in $\mathcal{D}$…
This paper presents Area coverage of homogenous wireless sensor network using computational geometry. The concepts related to both coverage wireless sensor network and computational geometry have been introduced. Then, the problem has been…
The growing number of devices using the wireless spectrum makes it important to find ways to minimize interference and optimize the use of the spectrum. Deep learning models, such as convolutional neural networks (CNNs), have been widely…
Searching for small objects in large images is a task that is both challenging for current deep learning systems and important in numerous real-world applications, such as remote sensing and medical imaging. Thorough scanning of very large…
Treating class with a single center may hardly capture data distribution complexities. Using multiple sub-centers is an alternative way to address this problem. However, highly correlated sub-classes, the classifier's parameters grow…
Several algorithms with an approximation guarantee of $O(\log n)$ are known for the Set Cover problem, where $n$ is the number of elements. We study a generalization of the Set Cover problem, called the Partition Set Cover problem. Here,…
This report considers the class of applications of sensor networks in which each sensor node makes measurements, such as temperature or humidity, at the precise location of the node. Such spot-sensing applications approximate the physical…
We continue the study of $\delta$-dispersion, a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal is to position as many…
3D point cloud segmentation has a wide range of applications in areas such as autonomous driving, augmented reality, virtual reality and digital twins. The point cloud data collected in real scenes often contain small objects and categories…
We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset…
First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomial-time exact solutions. Next, we consider the following general…
We study the problem of covering a given point set in the plane by unit disks so that each point is covered exactly once. We prove that 17 points can always be exactly covered. On the other hand, we construct a set of 657 points where an…
In this paper, we study two classic optimization problems: minimum geometric dominating set and set cover. In the dominating-set problem, for a given set of objects in {the} plane as input, the objective is to choose a minimum number of…
Various real-world problems consist of partitioning a set of locations into disjoint subsets, each subset spread in a way that it covers the whole set with a certain radius. Given a finite set S, a metric d, and a radius r, define a subset…
In optimization or machine learning problems we are given a set of items, usually points in some metric space, and the goal is to minimize or maximize an objective function over some space of candidate solutions. For example, in clustering…
Sensor Networks are inherently complex networks, and many of their associated problems require analysis of some of their global characteristics. These are primarily affected by the topology of the network. We present in this paper, a…
In randomly deployed networks, such as sensor networks, an important problem for each node is to discover its \textit{neighbor} nodes so that the connectivity amongst nodes can be established. In this paper, we consider this problem by…
A variant of the well-known Set Covering Problem is studied in this paper, where subsets of a collection have to be selected, and pairwise conflicts among subsets of items exist. The selection of each subset has a cost, and the inclusion of…
We carry out a structural and algorithmic study of a mobile sensor coverage optimization problem targeting 2D surfaces embedded in a 3D workspace. The investigated settings model multiple important applications including camera network…
This work considers the identification of the available whitespace, i.e., the regions that are not covered by any of the existing transmitters, within a given geographical area. To this end, $n$ sensors are deployed at random locations…