research
∙
08/19/2023
Securing Pathways with Orthogonal Robots
The protection of pathways holds immense significance across various dom...
share
research
∙
08/19/2023
Minimizing Turns in Watchman Robot Navigation: Strategies and Solutions
The Orthogonal Watchman Route Problem (OWRP) entails the search for the ...
research
∙
11/03/2022
Computing a many-to-many matching with demands and capacities between two sets using the Hungarian algorithm
Given two sets A=a_1,a_2,...,a_s and b_1,b_2,...,b_t, a many-to-many mat...
research
∙
10/15/2019
Apply Sorting Algorithms to FAST Problem
FAST problem is finding minimum feedback arc set problem in tournaments....
research
∙
04/09/2019
A Fast and Efficient algorithm for Many-To-Many Matching of Points with Demands in One Dimension
Given two point sets S and T, we first study the many-to-many matching w...
research
∙
04/04/2019
A Faster Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension
Given two point sets S and T on a line, we present a linear time algorit...
research
∙
03/27/2018
A New Optimal Algorithm for Computing the Visibility Area of a simple Polygon from a Viewpoint
Given a simple polygon P of n vertices in the Plane. We study the pr...
research
∙
03/27/2018
An Optimal Algorithm for Computing the Visibility Area of a Polygon from a Point Using Constant-Memory
Given a simple polygon P of n vertices in the Plane. We study the prob...
research
∙
02/22/2018
Adversarial Training for Probabilistic Spiking Neural Networks
Classifiers trained using conventional empirical risk minimization or ma...
research
∙
10/29/2017
Training Probabilistic Spiking Neural Networks with First-to-spike Decoding
Third-generation neural networks, or Spiking Neural Networks (SNNs), aim...
research
∙
09/05/2017
Guarding Path Polygons with Orthogonal Visibility
We are interested in the problem of guarding simple orthogonal polygons ...
research
∙
08/19/2017
Minimum Hidden Guarding of Histogram Polygons
A hidden guard set G is a set of point guards in polygon P that all ...
research
∙
08/04/2017
A Linear-time Algorithm for Orthogonal Watchman Route Problem with Minimum Bends
Given an orthogonal polygon P with n vertices, the goal of the watch...
research
∙
08/04/2017