Comparison to traditionally accurate computing, approximate computing focuses on the rapidity of the satisfactory solution, but not the unnecessary accuracy of the solution. Approximate bisimularity is the approximate one corresponding to traditionally accurate bisimilarity. Based on the work of distances between basic processes, we propose an algebraic approach for distances between processes ...

Exploiting the error resilience of emerging data-rich applications, approximate computing promotes the introduction of small amount of inaccuracy into computing systems to achieve significant reduction in computing resources such as power, design area, runtime or energy. Successful applications for approximate computing have been demonstrated in the areas of machine learning, image processing a...

Graphs (networks) are an important tool to model data in different domains. Realworld graphs usually directed, where the edges have a direction and they not symmetric. Betweenness centrality is index widely used analyze networks. In this paper, first given directed network G vertex r ∈ V (G), we propose exact algorithm compute betweenness score of r. Our pre-computes set ℛ