Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Two-dimensional phase unwrapping is the problem of deducing unambiguous "phase" from values known only modulo 2. Many authors agree that the objective of phase unwrappin...
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
In this paper, an optimized approximation algorithm (OAA) is proposed to address the overfitting problem in function approximation using neural networks (NNs). The optimized approx...